Base | Representation |
---|---|
bin | 11111001001001000000… |
… | …110100110001101101111 |
3 | 21120120222111010010001222 |
4 | 133021020012212031233 |
5 | 240030412432333401 |
6 | 4315052215053555 |
7 | 310421520526655 |
oct | 37111006461557 |
9 | 7516874103058 |
10 | 2140103402351 |
11 | 75568163a712 |
12 | 2a69243712bb |
13 | 126a7068b695 |
14 | 7581db16dd5 |
15 | 3aa07d26c1b |
hex | 1f2481a636f |
2140103402351 has 2 divisors, whose sum is σ = 2140103402352. Its totient is φ = 2140103402350.
The previous prime is 2140103402329. The next prime is 2140103402377. The reversal of 2140103402351 is 1532043010412.
It is a happy number.
It is an a-pointer prime, because the next prime (2140103402377) can be obtained adding 2140103402351 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2140103402351 - 214 = 2140103385967 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2140103402351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2140103402051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070051701175 + 1070051701176.
It is an arithmetic number, because the mean of its divisors is an integer number (1070051701176).
Almost surely, 22140103402351 is an apocalyptic number.
2140103402351 is a deficient number, since it is larger than the sum of its proper divisors (1).
2140103402351 is an equidigital number, since it uses as much as digits as its factorization.
2140103402351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 2140103402351 its reverse (1532043010412), we get a palindrome (3672146412763).
The spelling of 2140103402351 in words is "two trillion, one hundred forty billion, one hundred three million, four hundred two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •