Base | Representation |
---|---|
bin | 1001001011111101101001… |
… | …0001000110110011011111 |
3 | 1022202122210010020002020021 |
4 | 2102333122101012303133 |
5 | 2310444103241432203 |
6 | 33252221200333011 |
7 | 2061532263411634 |
oct | 222773221066337 |
9 | 38678703202207 |
10 | 10101130030303 |
11 | 3244957625664 |
12 | 1171800014167 |
13 | 5836bcb01640 |
14 | 26cc7c2a818b |
15 | 127b484965bd |
hex | 92fda446cdf |
10101130030303 has 8 divisors (see below), whose sum is σ = 10895110618896. Its totient is φ = 9309573811200.
The previous prime is 10101130030273. The next prime is 10101130030307. The reversal of 10101130030303 is 30303003110101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10101130030303 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 (10101130030307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 606083713 + ... + 606100378.
It is an arithmetic number, because the mean of its divisors is an integer number (1361888827362).
Almost surely, 210101130030303 is an apocalyptic number.
10101130030303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10101130030303 is a deficient number, since it is larger than the sum of its proper divisors (793980588593).
10101130030303 is a wasteful number, since it uses less digits than its factorization.
10101130030303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212184745.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 10101130030303 its reverse (30303003110101), we get a palindrome (40404133140404).
The spelling of 10101130030303 in words is "ten trillion, one hundred one billion, one hundred thirty million, thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •