Base | Representation |
---|---|
bin | 111100111000000… |
… | …000001111100111 |
3 | 2122011210010110022 |
4 | 330320000033213 |
5 | 4042424022043 |
6 | 245202145355 |
7 | 34211011622 |
oct | 7470001747 |
9 | 2564703408 |
10 | 1021314023 |
11 | 484561384 |
12 | 24605225b |
13 | 133790732 |
14 | 998d8db9 |
15 | 5e9e1868 |
hex | 3ce003e7 |
1021314023 has 2 divisors, whose sum is σ = 1021314024. Its totient is φ = 1021314022.
The previous prime is 1021314017. The next prime is 1021314029. The reversal of 1021314023 is 3204131201.
1021314023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (1021314017) and next prime (1021314029).
It is a cyclic number.
It is not a de Polignac number, because 1021314023 - 28 = 1021313767 is a prime.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 1021313992 and 1021314010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021314029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510657011 + 510657012.
It is an arithmetic number, because the mean of its divisors is an integer number (510657012).
Almost surely, 21021314023 is an apocalyptic number.
1021314023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021314023 is an equidigital number, since it uses as much as digits as its factorization.
1021314023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1021314023 is about 31958.0040521932. The cubic root of 1021314023 is about 1007.0547872709.
Adding to 1021314023 its reverse (3204131201), we get a palindrome (4225445224).
The spelling of 1021314023 in words is "one billion, twenty-one million, three hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •