Base | Representation |
---|---|
bin | 10100001110110001100… |
… | …011000110100111001111 |
3 | 11220220111010200100122021 |
4 | 110032301203012213033 |
5 | 140234214310042332 |
6 | 2542401251031011 |
7 | 202304525161633 |
oct | 24166143064717 |
9 | 4826433610567 |
10 | 1390253205967 |
11 | 49666a76670a |
12 | 1a5534b9b467 |
13 | a113c512422 |
14 | 4b407d58dc3 |
15 | 2626c61ac97 |
hex | 143b18c69cf |
1390253205967 has 16 divisors (see below), whose sum is σ = 1522856993760. Its totient is φ = 1263300369408.
The previous prime is 1390253205919. The next prime is 1390253205977. The reversal of 1390253205967 is 7695023520931.
It is a cyclic number.
It is not a de Polignac number, because 1390253205967 - 219 = 1390252681679 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1390253205977) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15962803 + ... + 16049659.
It is an arithmetic number, because the mean of its divisors is an integer number (95178562110).
Almost surely, 21390253205967 is an apocalyptic number.
1390253205967 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1390253205967 is a deficient number, since it is larger than the sum of its proper divisors (132603787793).
1390253205967 is a wasteful number, since it uses less digits than its factorization.
1390253205967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119370.
The product of its (nonzero) digits is 3061800, while the sum is 52.
The spelling of 1390253205967 in words is "one trillion, three hundred ninety billion, two hundred fifty-three million, two hundred five thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •