Base | Representation |
---|---|
bin | 1001000111001111011100… |
… | …1101110000011111011001 |
3 | 1022110220101211001021202022 |
4 | 2101303313031300133121 |
5 | 2303131440344004423 |
6 | 33151044000544225 |
7 | 2052631135610114 |
oct | 221636715603731 |
9 | 38426354037668 |
10 | 10020011313113 |
11 | 321351018a81a |
12 | 1159b41622075 |
13 | 578b62c945b9 |
14 | 268d84b1b57b |
15 | 12599bb95dc8 |
hex | 91cf73707d9 |
10020011313113 has 16 divisors (see below), whose sum is σ = 10226787197184. Its totient is φ = 9815070457920.
The previous prime is 10020011313089. The next prime is 10020011313119. The reversal of 10020011313113 is 31131311002001.
It is a cyclic number.
It is not a de Polignac number, because 10020011313113 - 26 = 10020011313049 is a prime.
It is a super-3 number, since 3×100200113131133 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10020011313091 and 10020011313100.
It is not an unprimeable number, because it can be changed into a prime (10020011313119) 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, 146292431 + ... + 146360907.
It is an arithmetic number, because the mean of its divisors is an integer number (639174199824).
Almost surely, 210020011313113 is an apocalyptic number.
It is an amenable number.
10020011313113 is a deficient number, since it is larger than the sum of its proper divisors (206775884071).
10020011313113 is a wasteful number, since it uses less digits than its factorization.
10020011313113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81832.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10020011313113 its reverse (31131311002001), we get a palindrome (41151322315114).
The spelling of 10020011313113 in words is "ten trillion, twenty billion, eleven million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •