Base | Representation |
---|---|
bin | 10111101100101010… |
… | …00000000100100000 |
3 | 1012211122212211021012 |
4 | 23312111000010200 |
5 | 202023443310130 |
6 | 5502242120052 |
7 | 630164420303 |
oct | 136625000440 |
9 | 35748784235 |
10 | 12722635040 |
11 | 5439661015 |
12 | 2570950028 |
13 | 1279a9a81b |
14 | 8899a8b3a |
15 | 4e6e14995 |
hex | 2f6540120 |
12722635040 has 24 divisors (see below), whose sum is σ = 30057225660. Its totient is φ = 5089053952.
The previous prime is 12722635033. The next prime is 12722635043. The reversal of 12722635040 is 4053622721.
It can be written as a sum of positive squares in 2 ways, for example, as 12712111504 + 10523536 = 112748^2 + 3244^2 .
It is a super-2 number, since 2×127226350402 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 12722634988 and 12722635006.
It is not an unprimeable number, because it can be changed into a prime (12722635043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39758075 + ... + 39758394.
Almost surely, 212722635040 is an apocalyptic number.
12722635040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12722635040 is an abundant number, since it is smaller than the sum of its proper divisors (17334590620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12722635040 is an equidigital number, since it uses as much as digits as its factorization.
12722635040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79516484 (or 79516476 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 32.
The spelling of 12722635040 in words is "twelve billion, seven hundred twenty-two million, six hundred thirty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •