Base | Representation |
---|---|
bin | 1001100110011010010101… |
… | …1111110011101100100000 |
3 | 1101101002121201121101021122 |
4 | 2121212211133303230200 |
5 | 2340420141333200440 |
6 | 34241045050311412 |
7 | 2136416260012301 |
oct | 231464537635440 |
9 | 41332551541248 |
10 | 10555511225120 |
11 | 33aa6269a5574 |
12 | 122588b428568 |
13 | 5b74c3a8a064 |
14 | 286c649bc7a8 |
15 | 13488e1a67b5 |
hex | 999a57f3b20 |
10555511225120 has 48 divisors (see below), whose sum is σ = 24970337953848. Its totient is φ = 4216626892800.
The previous prime is 10555511225117. The next prime is 10555511225137. The reversal of 10555511225120 is 2152211555501.
It can be written as a sum of positive squares in 4 ways, for example, as 10115427586576 + 440083638544 = 3180476^2 + 663388^2 .
It is a super-2 number, since 2×105555112251202 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43453481 + ... + 43695720.
Almost surely, 210555511225120 is an apocalyptic number.
10555511225120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10555511225120 is an abundant number, since it is smaller than the sum of its proper divisors (14414826728728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10555511225120 is an equidigital number, since it uses as much as digits as its factorization.
10555511225120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87149973 (or 87149965 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 35.
The spelling of 10555511225120 in words is "ten trillion, five hundred fifty-five billion, five hundred eleven million, two hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •