Base | Representation |
---|---|
bin | 1001010000111100111000… |
… | …10111011000011101111000 |
3 | 2200010200221220222211002000 |
4 | 10220132130113120131320 |
5 | 10132300220213311102 |
6 | 111155305504141000 |
7 | 4201643056232163 |
oct | 450363427303570 |
9 | 80120856884060 |
10 | 20373653260152 |
11 | 6545466141875 |
12 | 2350673307760 |
13 | b4a2c539738a |
14 | 50613926aada |
15 | 254e7373801c |
hex | 12879c5d8778 |
20373653260152 has 96 divisors (see below), whose sum is σ = 59728854430800. Its totient is φ = 6433785215424.
The previous prime is 20373653260127. The next prime is 20373653260189. The reversal of 20373653260152 is 25106235637302.
20373653260152 is a `hidden beast` number, since 2 + 0 + 3 + 7 + 3 + 6 + 5 + 32 + 601 + 5 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 20373653260098 and 20373653260107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 130562563 + ... + 130718514.
Almost surely, 220373653260152 is an apocalyptic number.
It is an amenable number.
20373653260152 is an abundant number, since it is smaller than the sum of its proper divisors (39355201170648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20373653260152 is a wasteful number, since it uses less digits than its factorization.
20373653260152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261281130 (or 261281101 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 45.
Adding to 20373653260152 its reverse (25106235637302), we get a palindrome (45479888897454).
The spelling of 20373653260152 in words is "twenty trillion, three hundred seventy-three billion, six hundred fifty-three million, two hundred sixty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •