Base | Representation |
---|---|
bin | 1001000111001111110010… |
… | …0001010000100100010001 |
3 | 1022110220122000111212022221 |
4 | 2101303330201100210101 |
5 | 2303132131134430223 |
6 | 33151100500301041 |
7 | 2052633266231101 |
oct | 221637441204421 |
9 | 38426560455287 |
10 | 10020100311313 |
11 | 3213556447454 |
12 | 1159b673a1781 |
13 | 578b78555561 |
14 | 268d92887201 |
15 | 1259a48c5b5d |
hex | 91cfc850911 |
10020100311313 has 4 divisors (see below), whose sum is σ = 10020173719588. Its totient is φ = 10020026903040.
The previous prime is 10020100311283. The next prime is 10020100311317. The reversal of 10020100311313 is 31311300102001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4593357676944 + 5426742634369 = 2143212^2 + 2329537^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10020100311313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10020100311317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36499008 + ... + 36772513.
It is an arithmetic number, because the mean of its divisors is an integer number (2505043429897).
Almost surely, 210020100311313 is an apocalyptic number.
It is an amenable number.
10020100311313 is a deficient number, since it is larger than the sum of its proper divisors (73408275).
10020100311313 is an equidigital number, since it uses as much as digits as its factorization.
10020100311313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73408274.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10020100311313 its reverse (31311300102001), we get a palindrome (41331400413314).
The spelling of 10020100311313 in words is "ten trillion, twenty billion, one hundred million, three hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •