Base | Representation |
---|---|
bin | 111010101101111000… |
… | …0000011000001101111 |
3 | 110001110122221001121100 |
4 | 1311123300003001233 |
5 | 4031214400423201 |
6 | 133532042334143 |
7 | 12052465663605 |
oct | 1653360030157 |
9 | 401418831540 |
10 | 126093373551 |
11 | 49526470932 |
12 | 205304ba353 |
13 | bb76716752 |
14 | 61626dd875 |
15 | 342edd4886 |
hex | 1d5bc0306f |
126093373551 has 24 divisors (see below), whose sum is σ = 185458023296. Its totient is φ = 82538818560.
The previous prime is 126093373513. The next prime is 126093373603. The reversal of 126093373551 is 155373390621.
126093373551 is a `hidden beast` number, since 1 + 2 + 6 + 0 + 93 + 3 + 7 + 3 + 551 = 666.
It is not a de Polignac number, because 126093373551 - 29 = 126093373039 is a prime.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126093373497 and 126093373506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126093373151) 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 23 ways as a sum of consecutive naturals, for example, 283810 + ... + 576831.
Almost surely, 2126093373551 is an apocalyptic number.
126093373551 is a deficient number, since it is larger than the sum of its proper divisors (59364649745).
126093373551 is a wasteful number, since it uses less digits than its factorization.
126093373551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860943 (or 860940 counting only the distinct ones).
The product of its (nonzero) digits is 510300, while the sum is 45.
The spelling of 126093373551 in words is "one hundred twenty-six billion, ninety-three million, three hundred seventy-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •