Base | Representation |
---|---|
bin | 1001100110001010011000… |
… | …0010000010100001101110 |
3 | 1101100200120000202100022002 |
4 | 2121202212002002201232 |
5 | 2340332402124401340 |
6 | 34235055502452302 |
7 | 2136205124453060 |
oct | 231424602024156 |
9 | 41320500670262 |
10 | 10551225231470 |
11 | 33a8827634060 |
12 | 1224a93b94092 |
13 | 5b6c8cb32b41 |
14 | 28697969d730 |
15 | 1346dcc8c715 |
hex | 998a608286e |
10551225231470 has 128 divisors (see below), whose sum is σ = 23842975242240. Its totient is φ = 3265900254720.
The previous prime is 10551225231419. The next prime is 10551225231539. The reversal of 10551225231470 is 7413252215501.
It is a super-2 number, since 2×105512252314702 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 137424332 + ... + 137501088.
It is an arithmetic number, because the mean of its divisors is an integer number (186273244080).
Almost surely, 210551225231470 is an apocalyptic number.
10551225231470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10551225231470 is an abundant number, since it is smaller than the sum of its proper divisors (13291750010770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10551225231470 is a wasteful number, since it uses less digits than its factorization.
10551225231470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78018.
The product of its (nonzero) digits is 84000, while the sum is 38.
Adding to 10551225231470 its reverse (7413252215501), we get a palindrome (17964477446971).
The spelling of 10551225231470 in words is "ten trillion, five hundred fifty-one billion, two hundred twenty-five million, two hundred thirty-one thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •