Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …100011000111000110111101 |
3 | 111020122122221100020002110022 |
4 | 112331322313203013012331 |
5 | 101214440310244131023 |
6 | 554500154421221525 |
7 | 30163612335564614 |
oct | 2675726743070675 |
9 | 436578840202408 |
10 | 101012120302013 |
11 | 2a204aaa591398 |
12 | b3b49aa8618a5 |
13 | 444952c47780b |
14 | 1ad3026c3087b |
15 | ba285511b7c8 |
hex | 5bdeb78c71bd |
101012120302013 has 24 divisors (see below), whose sum is σ = 105621174808512. Its totient is φ = 96551015670144.
The previous prime is 101012120302007. The next prime is 101012120302039. The reversal of 101012120302013 is 310203021210101.
It is not a de Polignac number, because 101012120302013 - 24 = 101012120301997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101012120301982 and 101012120302000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012120302043) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 761444456 + ... + 761577102.
It is an arithmetic number, because the mean of its divisors is an integer number (4400882283688).
Almost surely, 2101012120302013 is an apocalyptic number.
It is an amenable number.
101012120302013 is a deficient number, since it is larger than the sum of its proper divisors (4609054506499).
101012120302013 is an equidigital number, since it uses as much as digits as its factorization.
101012120302013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140801 (or 140754 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101012120302013 its reverse (310203021210101), we get a palindrome (411215141512114).
The spelling of 101012120302013 in words is "one hundred one trillion, twelve billion, one hundred twenty million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •