Base | Representation |
---|---|
bin | 101000000011101… |
… | …0101111010000111 |
3 | 10110200011110100102 |
4 | 1100013111322013 |
5 | 10223042231043 |
6 | 341212434315 |
7 | 45210451535 |
oct | 12007257207 |
9 | 3420143312 |
10 | 1344102023 |
11 | 62a78a820 |
12 | 31617899b |
13 | 185609954 |
14 | ca721155 |
15 | 7d0026b8 |
hex | 501d5e87 |
1344102023 has 4 divisors (see below), whose sum is σ = 1466293128. Its totient is φ = 1221910920.
The previous prime is 1344101977. The next prime is 1344102029. The reversal of 1344102023 is 3202014431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1344102023 - 26 = 1344101959 is a prime.
It is a super-2 number, since 2×13441020232 = 3613220496465385058, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1344101986 and 1344102004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1344102029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61095536 + ... + 61095557.
It is an arithmetic number, because the mean of its divisors is an integer number (366573282).
Almost surely, 21344102023 is an apocalyptic number.
1344102023 is a deficient number, since it is larger than the sum of its proper divisors (122191105).
1344102023 is a wasteful number, since it uses less digits than its factorization.
1344102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122191104.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 1344102023 is about 36661.9969859799. The cubic root of 1344102023 is about 1103.5975938262.
Adding to 1344102023 its reverse (3202014431), we get a palindrome (4546116454).
The spelling of 1344102023 in words is "one billion, three hundred forty-four million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •