Base | Representation |
---|---|
bin | 111100110111001… |
… | …011111111110111 |
3 | 2122011101020220101 |
4 | 330313023333313 |
5 | 4042400200043 |
6 | 245153414531 |
7 | 34206130666 |
oct | 7467137767 |
9 | 2564336811 |
10 | 1021100023 |
11 | 484425619 |
12 | 245b6a447 |
13 | 1337171c8 |
14 | 99880ddd |
15 | 5e99d24d |
hex | 3cdcbff7 |
1021100023 has 2 divisors, whose sum is σ = 1021100024. Its totient is φ = 1021100022.
The previous prime is 1021100021. The next prime is 1021100027. The reversal of 1021100023 is 3200011201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1021100023 - 21 = 1021100021 is a prime.
It is a super-3 number, since 3×10211000233 (a number of 28 digits) contains 333 as substring.
Together with 1021100021, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1021099982 and 1021100009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021100021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510550011 + 510550012.
It is an arithmetic number, because the mean of its divisors is an integer number (510550012).
Almost surely, 21021100023 is an apocalyptic number.
1021100023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021100023 is an equidigital number, since it uses as much as digits as its factorization.
1021100023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1021100023 is about 31954.6557327723. The cubic root of 1021100023 is about 1006.9844449558.
Adding to 1021100023 its reverse (3200011201), we get a palindrome (4221111224).
The spelling of 1021100023 in words is "one billion, twenty-one million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •