Base | Representation |
---|---|
bin | 101010001001000… |
… | …0011101110110111 |
3 | 10122112201122210222 |
4 | 1110102003232313 |
5 | 10343442120043 |
6 | 352151204555 |
7 | 50016654233 |
oct | 12422035667 |
9 | 3575648728 |
10 | 1414020023 |
11 | 6661a5199 |
12 | 33567675b |
13 | 196c4a050 |
14 | d5b215c3 |
15 | 84213d68 |
hex | 54483bb7 |
1414020023 has 8 divisors (see below), whose sum is σ = 1529112816. Its totient is φ = 1299830400.
The previous prime is 1414020017. The next prime is 1414020043. The reversal of 1414020023 is 3200204141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1414020023 - 218 = 1413757879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1414019983 and 1414020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414020043) 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, 222533 + ... + 228798.
It is an arithmetic number, because the mean of its divisors is an integer number (191139102).
Almost surely, 21414020023 is an apocalyptic number.
1414020023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1414020023 is a deficient number, since it is larger than the sum of its proper divisors (115092793).
1414020023 is a wasteful number, since it uses less digits than its factorization.
1414020023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451585.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 1414020023 is about 37603.4575936841. The cubic root of 1414020023 is about 1122.4108418726.
Adding to 1414020023 its reverse (3200204141), we get a palindrome (4614224164).
The spelling of 1414020023 in words is "one billion, four hundred fourteen million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •