Base | Representation |
---|---|
bin | 1001110001100011001110… |
… | …0010101101011001000001 |
3 | 1102001101120001101021002210 |
4 | 2130120303202231121001 |
5 | 2402034043431131200 |
6 | 34505013435332333 |
7 | 2156302346344260 |
oct | 234306342553101 |
9 | 42041501337083 |
10 | 10746872911425 |
11 | 34737a5651842 |
12 | 1256995bb10a9 |
13 | 5cc56c5443c1 |
14 | 2922197185d7 |
15 | 13983e095650 |
hex | 9c6338ad641 |
10746872911425 has 384 divisors, whose sum is σ = 22597582233600. Its totient is φ = 4393785876480.
The previous prime is 10746872911339. The next prime is 10746872911427. The reversal of 10746872911425 is 52411927864701.
It is not a de Polignac number, because 10746872911425 - 28 = 10746872911169 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (10746872911427) by changing a digit.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 7827292039 + ... + 7827293411.
It is an arithmetic number, because the mean of its divisors is an integer number (58847870400).
Almost surely, 210746872911425 is an apocalyptic number.
10746872911425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10746872911425 is an abundant number, since it is smaller than the sum of its proper divisors (11850709322175).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10746872911425 is a wasteful number, since it uses less digits than its factorization.
10746872911425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1857 (or 1852 counting only the distinct ones).
The product of its (nonzero) digits is 6773760, while the sum is 57.
The spelling of 10746872911425 in words is "ten trillion, seven hundred forty-six billion, eight hundred seventy-two million, nine hundred eleven thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •