Base | Representation |
---|---|
bin | 11101101101111100100… |
… | …11100000000000010111 |
3 | 10121121122012212002222120 |
4 | 32312332103200000113 |
5 | 113212203102011043 |
6 | 2101030433231023 |
7 | 133525545031251 |
oct | 16667623400027 |
9 | 3547565762876 |
10 | 1021100032023 |
11 | 364056391295 |
12 | 145a90402473 |
13 | 7539b8358a6 |
14 | 375c8878cd1 |
15 | 1b863d72983 |
hex | edbe4e0017 |
1021100032023 has 8 divisors (see below), whose sum is σ = 1371859585536. Its totient is φ = 675536916600.
The previous prime is 1021100032003. The next prime is 1021100032027. The reversal of 1021100032023 is 3202300011201.
1021100032023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1021100032023 - 213 = 1021100023831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021100031993 and 1021100032011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021100032027) 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, 1299109063 + ... + 1299109848.
It is an arithmetic number, because the mean of its divisors is an integer number (171482448192).
Almost surely, 21021100032023 is an apocalyptic number.
1021100032023 is a deficient number, since it is larger than the sum of its proper divisors (350759553513).
1021100032023 is a wasteful number, since it uses less digits than its factorization.
1021100032023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2598219045.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1021100032023 its reverse (3202300011201), we get a palindrome (4223400043224).
The spelling of 1021100032023 in words is "one trillion, twenty-one billion, one hundred million, thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •