Base | Representation |
---|---|
bin | 1001010100011100011101… |
… | …1000011001110010011111 |
3 | 1100021120220001010100012012 |
4 | 2111013013120121302133 |
5 | 2320341013032022111 |
6 | 33443200111101435 |
7 | 2105211204306536 |
oct | 225070730316237 |
9 | 40246801110165 |
10 | 10246842064031 |
11 | 32a0730235231 |
12 | 1195aa681187b |
13 | 594371bb5a41 |
14 | 275d4238531d |
15 | 12b8258bc48b |
hex | 951c7619c9f |
10246842064031 has 2 divisors, whose sum is σ = 10246842064032. Its totient is φ = 10246842064030.
The previous prime is 10246842064003. The next prime is 10246842064049. The reversal of 10246842064031 is 13046024864201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10246842064031 - 26 = 10246842063967 is a prime.
It is a super-2 number, since 2×102468420640312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10246842064031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10246842066031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5123421032015 + 5123421032016.
It is an arithmetic number, because the mean of its divisors is an integer number (5123421032016).
Almost surely, 210246842064031 is an apocalyptic number.
10246842064031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10246842064031 is an equidigital number, since it uses as much as digits as its factorization.
10246842064031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 221184, while the sum is 41.
The spelling of 10246842064031 in words is "ten trillion, two hundred forty-six billion, eight hundred forty-two million, sixty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •