Base | Representation |
---|---|
bin | 1001000111010000001010… |
… | …0001101111001011110111 |
3 | 1022110220220001011110110010 |
4 | 2101310002201233023313 |
5 | 2303132332440200043 |
6 | 33151114500431303 |
7 | 2052635632016532 |
oct | 221640241571367 |
9 | 38426801143403 |
10 | 10020201100023 |
11 | 32135a8327504 |
12 | 1159b950a8533 |
13 | 578b933b404a |
14 | 268da2001a19 |
15 | 1259ad684133 |
hex | 91d0286f2f7 |
10020201100023 has 32 divisors (see below), whose sum is σ = 14259203608320. Its totient is φ = 6236980206080.
The previous prime is 10020201099977. The next prime is 10020201100067. The reversal of 10020201100023 is 32000110202001.
10020201100023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10020201100023 - 233 = 10011611165431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10020201099981 and 10020201100008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020201100523) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18689668 + ... + 19218326.
It is an arithmetic number, because the mean of its divisors is an integer number (445600112760).
Almost surely, 210020201100023 is an apocalyptic number.
10020201100023 is a deficient number, since it is larger than the sum of its proper divisors (4239002508297).
10020201100023 is a wasteful number, since it uses less digits than its factorization.
10020201100023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 531647.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10020201100023 its reverse (32000110202001), we get a palindrome (42020311302024).
The spelling of 10020201100023 in words is "ten trillion, twenty billion, two hundred one million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •