Base | Representation |
---|---|
bin | 1001001111000110100110… |
… | …00000100010101011110101 |
3 | 2122220122000221221211220102 |
4 | 10213203103000202223311 |
5 | 10130230134222311013 |
6 | 111110204012443445 |
7 | 4164234224246063 |
oct | 447432300425365 |
9 | 78818027854812 |
10 | 20310145510133 |
11 | 6520536724256 |
12 | 23402aa779585 |
13 | b44313cb917b |
14 | 50303299d033 |
15 | 2534a8096d58 |
hex | 1278d3022af5 |
20310145510133 has 16 divisors (see below), whose sum is σ = 21111601795200. Its totient is φ = 19515558552000.
The previous prime is 20310145510129. The next prime is 20310145510139. The reversal of 20310145510133 is 33101554101302.
It is a cyclic number.
It is not a de Polignac number, because 20310145510133 - 22 = 20310145510129 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 20310145510096 and 20310145510105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20310145510139) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7679288 + ... + 9979566.
It is an arithmetic number, because the mean of its divisors is an integer number (1319475112200).
Almost surely, 220310145510133 is an apocalyptic number.
It is an amenable number.
20310145510133 is a deficient number, since it is larger than the sum of its proper divisors (801456285067).
20310145510133 is a wasteful number, since it uses less digits than its factorization.
20310145510133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2301772.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 20310145510133 its reverse (33101554101302), we get a palindrome (53411699611435).
The spelling of 20310145510133 in words is "twenty trillion, three hundred ten billion, one hundred forty-five million, five hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •