Base | Representation |
---|---|
bin | 100111001011100… |
… | …0100100110101111 |
3 | 10101121210012121101 |
4 | 1032113010212233 |
5 | 10143023433043 |
6 | 334241543531 |
7 | 44402343061 |
oct | 11627044657 |
9 | 3347705541 |
10 | 1314671023 |
11 | 615108886 |
12 | 308344ba7 |
13 | 17c4a3963 |
14 | c685d731 |
15 | 7a63c24d |
hex | 4e5c49af |
1314671023 has 4 divisors (see below), whose sum is σ = 1314859680. Its totient is φ = 1314482368.
The previous prime is 1314671011. The next prime is 1314671077. The reversal of 1314671023 is 3201764131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3201764131 = 40903 ⋅78277.
It is a cyclic number.
It is not a de Polignac number, because 1314671023 - 217 = 1314539951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1314670982 and 1314671000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314671623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83458 + ... + 97951.
It is an arithmetic number, because the mean of its divisors is an integer number (328714920).
Almost surely, 21314671023 is an apocalyptic number.
1314671023 is a deficient number, since it is larger than the sum of its proper divisors (188657).
1314671023 is an equidigital number, since it uses as much as digits as its factorization.
1314671023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188656.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 1314671023 is about 36258.3924491972. The cubic root of 1314671023 is about 1095.4831372983.
The spelling of 1314671023 in words is "one billion, three hundred fourteen million, six hundred seventy-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •