Base | Representation |
---|---|
bin | 111010110111000101… |
… | …1101100111110100000 |
3 | 110002021012211001120220 |
4 | 1311232023230332200 |
5 | 4032333032110102 |
6 | 134022450403040 |
7 | 12063242325024 |
oct | 1655613547640 |
9 | 402235731526 |
10 | 126402613152 |
11 | 49674a86152 |
12 | 205b7b90480 |
13 | bbc57cac6a |
14 | 61917da384 |
15 | 344c11b1bc |
hex | 1d6e2ecfa0 |
126402613152 has 48 divisors (see below), whose sum is σ = 331844964192. Its totient is φ = 42129365760.
The previous prime is 126402613133. The next prime is 126402613153. The reversal of 126402613152 is 251316204621.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×1264026131522 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (126402613153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 819627 + ... + 961557.
It is an arithmetic number, because the mean of its divisors is an integer number (6913436754).
Almost surely, 2126402613152 is an apocalyptic number.
126402613152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
126402613152 is an abundant number, since it is smaller than the sum of its proper divisors (205442351040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126402613152 is a wasteful number, since it uses less digits than its factorization.
126402613152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151221 (or 151213 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
Adding to 126402613152 its reverse (251316204621), we get a palindrome (377718817773).
The spelling of 126402613152 in words is "one hundred twenty-six billion, four hundred two million, six hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •