Base | Representation |
---|---|
bin | 1000000010111… |
… | …10010101101000 |
3 | 11201000010002220 |
4 | 10001132111220 |
5 | 114234322042 |
6 | 10410354040 |
7 | 1446462135 |
oct | 401362550 |
9 | 151003086 |
10 | 67495272 |
11 | 35110219 |
12 | 1a72b920 |
13 | 10ca2740 |
14 | 8d6d58c |
15 | 5dd38ec |
hex | 405e568 |
67495272 has 64 divisors (see below), whose sum is σ = 182710080. Its totient is φ = 20654592.
The previous prime is 67495249. The next prime is 67495283. The reversal of 67495272 is 27259476.
It is a super-2 number, since 2×674952722 = 9111223484707968, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70348 + ... + 71300.
It is an arithmetic number, because the mean of its divisors is an integer number (2854845).
Almost surely, 267495272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67495272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91355040).
67495272 is an abundant number, since it is smaller than the sum of its proper divisors (115214808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67495272 is a wasteful number, since it uses less digits than its factorization.
67495272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1202 (or 1198 counting only the distinct ones).
The product of its digits is 211680, while the sum is 42.
The square root of 67495272 is about 8215.5506206218. The cubic root of 67495272 is about 407.1531357736.
It can be divided in two parts, 6749 and 5272, that added together give a palindrome (12021).
The spelling of 67495272 in words is "sixty-seven million, four hundred ninety-five thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •