Base | Representation |
---|---|
bin | 10111010010010001… |
… | …00100000010001010 |
3 | 1012021020100100102200 |
4 | 23221020210002022 |
5 | 201100311130131 |
6 | 5424253341030 |
7 | 621536022153 |
oct | 135110440212 |
9 | 35236310380 |
10 | 12501270666 |
11 | 5335706755 |
12 | 250a797776 |
13 | 1242c730a1 |
14 | 86842492a |
15 | 4d278a2e6 |
hex | 2e922408a |
12501270666 has 48 divisors (see below), whose sum is σ = 28550221440. Its totient is φ = 3942432000.
The previous prime is 12501270653. The next prime is 12501270667. The reversal of 12501270666 is 66607210521.
It is a happy number.
It is a super-3 number, since 3×125012706663 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12501270666.
It is not an unprimeable number, because it can be changed into a prime (12501270667) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 232506 + ... + 281178.
It is an arithmetic number, because the mean of its divisors is an integer number (594796280).
Almost surely, 212501270666 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12501270666, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14275110720).
12501270666 is an abundant number, since it is smaller than the sum of its proper divisors (16048950774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12501270666 is a wasteful number, since it uses less digits than its factorization.
12501270666 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49451 (or 49448 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 12501270666 in words is "twelve billion, five hundred one million, two hundred seventy thousand, six hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •