Base | Representation |
---|---|
bin | 111010111000110111… |
… | …0110001000101000101 |
3 | 110002102100211011110201 |
4 | 1311301232301011011 |
5 | 4032443301333040 |
6 | 134032414250501 |
7 | 12064564265635 |
oct | 1656156610505 |
9 | 402370734421 |
10 | 126462136645 |
11 | 496a5641019 |
12 | 20613ab6a31 |
13 | bc04c3c070 |
14 | 61996926c5 |
15 | 3452477a9a |
hex | 1d71bb1145 |
126462136645 has 32 divisors (see below), whose sum is σ = 168375459168. Its totient is φ = 90576258048.
The previous prime is 126462136631. The next prime is 126462136649. The reversal of 126462136645 is 546631264621.
It can be written as a sum of positive squares in 16 ways, for example, as 39809028484 + 86653108161 = 199522^2 + 294369^2 .
It is a cyclic number.
It is not a de Polignac number, because 126462136645 - 219 = 126461612357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126462136595 and 126462136604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126462136649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 679447 + ... + 845323.
It is an arithmetic number, because the mean of its divisors is an integer number (5261733099).
Almost surely, 2126462136645 is an apocalyptic number.
It is an amenable number.
126462136645 is a deficient number, since it is larger than the sum of its proper divisors (41913322523).
126462136645 is a wasteful number, since it uses less digits than its factorization.
126462136645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166249.
The product of its digits is 1244160, while the sum is 46.
The spelling of 126462136645 in words is "one hundred twenty-six billion, four hundred sixty-two million, one hundred thirty-six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •