Base | Representation |
---|---|
bin | 10110111101111010110001… |
… | …100101101011100100001101 |
3 | 111020122122200101002002101211 |
4 | 112331322301211223210031 |
5 | 101214440104144443313 |
6 | 554500140450134421 |
7 | 30163610012644534 |
oct | 2675726145534415 |
9 | 436578611062354 |
10 | 101012020312333 |
11 | 2a204a590a7699 |
12 | b3b4981281411 |
13 | 4449514838920 |
14 | 1ad301784331b |
15 | ba284b469e3d |
hex | 5bdeb196b90d |
101012020312333 has 16 divisors (see below), whose sum is σ = 112979684885760. Its totient is φ = 89711249720256.
The previous prime is 101012020312297. The next prime is 101012020312339. The reversal of 101012020312333 is 333213020210101.
It is not a de Polignac number, because 101012020312333 - 29 = 101012020311821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012020312339) 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, 1401001710 + ... + 1401073807.
It is an arithmetic number, because the mean of its divisors is an integer number (7061230305360).
Almost surely, 2101012020312333 is an apocalyptic number.
101012020312333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101012020312333 is a deficient number, since it is larger than the sum of its proper divisors (11967664573427).
101012020312333 is a wasteful number, since it uses less digits than its factorization.
101012020312333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2802075636.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 101012020312333 its reverse (333213020210101), we get a palindrome (434225040522434).
The spelling of 101012020312333 in words is "one hundred one trillion, twelve billion, twenty million, three hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •