Base | Representation |
---|---|
bin | 10010110000000110… |
… | …00101111010110000 |
3 | 221222121002201021010 |
4 | 21120003011322300 |
5 | 131104141442042 |
6 | 4342541430520 |
7 | 504321165120 |
oct | 113003057260 |
9 | 27877081233 |
10 | 10067140272 |
11 | 42a6702542 |
12 | 1b4b56b440 |
13 | c45897447 |
14 | 6b703cc80 |
15 | 3ddc2159c |
hex | 2580c5eb0 |
10067140272 has 160 divisors (see below), whose sum is σ = 32365785600. Its totient is φ = 2630928384.
The previous prime is 10067140217. The next prime is 10067140277. The reversal of 10067140272 is 27204176001.
It is a super-2 number, since 2×100671402722 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10067140277) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 157948 + ... + 212324.
It is an arithmetic number, because the mean of its divisors is an integer number (202286160).
Almost surely, 210067140272 is an apocalyptic number.
10067140272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10067140272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16182892800).
10067140272 is an abundant number, since it is smaller than the sum of its proper divisors (22298645328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10067140272 is a wasteful number, since it uses less digits than its factorization.
10067140272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54443 (or 54437 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 30.
The spelling of 10067140272 in words is "ten billion, sixty-seven million, one hundred forty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •