Base | Representation |
---|---|
bin | 1001001001000101000001… |
… | …1011010010101011110100 |
3 | 1022120220212101120011101211 |
4 | 2102101100123102223310 |
5 | 2304141110114214330 |
6 | 33213343453131204 |
7 | 2055126226061404 |
oct | 222212033225364 |
9 | 38526771504354 |
10 | 10051572804340 |
11 | 3225936893271 |
12 | 116408b489b04 |
13 | 57bb229cb5b2 |
14 | 26a6da6b4804 |
15 | 1266e7913d2a |
hex | 924506d2af4 |
10051572804340 has 48 divisors (see below), whose sum is σ = 21303154857600. Its totient is φ = 3983518611072.
The previous prime is 10051572804307. The next prime is 10051572804353. The reversal of 10051572804340 is 4340827515001.
It is a junction number, because it is equal to n+sod(n) for n = 10051572804293 and 10051572804302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41751231 + ... + 41991289.
It is an arithmetic number, because the mean of its divisors is an integer number (443815726200).
Almost surely, 210051572804340 is an apocalyptic number.
10051572804340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10051572804340 is an abundant number, since it is smaller than the sum of its proper divisors (11251582053260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10051572804340 is a wasteful number, since it uses less digits than its factorization.
10051572804340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259384 (or 259382 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 40.
The spelling of 10051572804340 in words is "ten trillion, fifty-one billion, five hundred seventy-two million, eight hundred four thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •