Base | Representation |
---|---|
bin | 111100011101101… |
… | …000101111100111 |
3 | 2121200202221222022 |
4 | 330131220233213 |
5 | 4034141331043 |
6 | 244354053355 |
7 | 34065163205 |
oct | 7435505747 |
9 | 2550687868 |
10 | 1014402023 |
11 | 480670288 |
12 | 24387a25b |
13 | 1322105ab |
14 | 98a1a075 |
15 | 5e0c8868 |
hex | 3c768be7 |
1014402023 has 2 divisors, whose sum is σ = 1014402024. Its totient is φ = 1014402022.
The previous prime is 1014401957. The next prime is 1014402029. The reversal of 1014402023 is 3202044101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1014402023 - 28 = 1014401767 is a prime.
It is a super-2 number, since 2×10144020232 = 2058022928532985058, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1014401992 and 1014402010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1014402029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507201011 + 507201012.
It is an arithmetic number, because the mean of its divisors is an integer number (507201012).
Almost surely, 21014402023 is an apocalyptic number.
1014402023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014402023 is an equidigital number, since it uses as much as digits as its factorization.
1014402023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 1014402023 is about 31849.6785384091. The cubic root of 1014402023 is about 1004.7778105050. Note that the first 3 decimals are identical.
Adding to 1014402023 its reverse (3202044101), we get a palindrome (4216446124).
The spelling of 1014402023 in words is "one billion, fourteen million, four hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •