Base | Representation |
---|---|
bin | 1001010100011001101111… |
… | …0100110001010110001011 |
3 | 1100021112000010001211120201 |
4 | 2111012123310301112023 |
5 | 2320333013443144201 |
6 | 33442555404233031 |
7 | 2105154122040211 |
oct | 225063364612613 |
9 | 40245003054521 |
10 | 10246111303051 |
11 | 32a0395795738 |
12 | 1195921b3b777 |
13 | 5942866961b0 |
14 | 275cb32c0cb1 |
15 | 12b7d1670801 |
hex | 9519bd3158b |
10246111303051 has 16 divisors (see below), whose sum is σ = 11060764049664. Its totient is φ = 9435263850144.
The previous prime is 10246111303037. The next prime is 10246111303067. The reversal of 10246111303051 is 15030311164201.
10246111303051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10246111303051 - 27 = 10246111302923 is a prime.
It is a super-2 number, since 2×102461113030512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10246112303051) 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, 11326060 + ... + 12197206.
It is an arithmetic number, because the mean of its divisors is an integer number (691297753104).
Almost surely, 210246111303051 is an apocalyptic number.
10246111303051 is a deficient number, since it is larger than the sum of its proper divisors (814652746613).
10246111303051 is a wasteful number, since it uses less digits than its factorization.
10246111303051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 873330.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 10246111303051 its reverse (15030311164201), we get a palindrome (25276422467252).
The spelling of 10246111303051 in words is "ten trillion, two hundred forty-six billion, one hundred eleven million, three hundred three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •