Base | Representation |
---|---|
bin | 1001100110010110011010… |
… | …0010101011111011001000 |
3 | 1101100222220010011100112110 |
4 | 2121211212202223323020 |
5 | 2340411010440440422 |
6 | 34240352200142320 |
7 | 2136351143250651 |
oct | 231454642537310 |
9 | 41328803140473 |
10 | 10554455015112 |
11 | 33aa13477a338 |
12 | 12256357679a0 |
13 | 5b7385ccc018 |
14 | 286ba45dc528 |
15 | 13482b5c060c |
hex | 999668abec8 |
10554455015112 has 32 divisors (see below), whose sum is σ = 26387866313280. Its totient is φ = 3517921168320.
The previous prime is 10554455015107. The next prime is 10554455015131. The reversal of 10554455015112 is 21151055445501.
10554455015112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×105544550151122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14032323 + ... + 14765330.
It is an arithmetic number, because the mean of its divisors is an integer number (824620822290).
Almost surely, 210554455015112 is an apocalyptic number.
10554455015112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10554455015112 is an abundant number, since it is smaller than the sum of its proper divisors (15833411298168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10554455015112 is a wasteful number, since it uses less digits than its factorization.
10554455015112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28812933 (or 28812929 counting only the distinct ones).
The product of its (nonzero) digits is 100000, while the sum is 39.
The spelling of 10554455015112 in words is "ten trillion, five hundred fifty-four billion, four hundred fifty-five million, fifteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •