Base | Representation |
---|---|
bin | 1001010100011001100001… |
… | …0111100011100001101111 |
3 | 1100021111212001221121200002 |
4 | 2111012120113203201233 |
5 | 2320332404122000443 |
6 | 33442545533254515 |
7 | 2105152516113002 |
oct | 225063027434157 |
9 | 40244761847602 |
10 | 10246053312623 |
11 | 32a0365a87667 |
12 | 119590663443b |
13 | 594277670b2b |
14 | 275ca9707539 |
15 | 12b7cb5182b8 |
hex | 951985e386f |
10246053312623 has 2 divisors, whose sum is σ = 10246053312624. Its totient is φ = 10246053312622.
The previous prime is 10246053312601. The next prime is 10246053312629. The reversal of 10246053312623 is 32621335064201.
10246053312623 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10246053312623 - 28 = 10246053312367 is a prime.
It is a super-2 number, since 2×102460533126232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10246053312629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5123026656311 + 5123026656312.
It is an arithmetic number, because the mean of its divisors is an integer number (5123026656312).
Almost surely, 210246053312623 is an apocalyptic number.
10246053312623 is a deficient number, since it is larger than the sum of its proper divisors (1).
10246053312623 is an equidigital number, since it uses as much as digits as its factorization.
10246053312623 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 155520, while the sum is 38.
Adding to 10246053312623 its reverse (32621335064201), we get a palindrome (42867388376824).
The spelling of 10246053312623 in words is "ten trillion, two hundred forty-six billion, fifty-three million, three hundred twelve thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •