Base | Representation |
---|---|
bin | 11110101101000100111… |
… | …11011110010100010000 |
3 | 10201212010021201202022220 |
4 | 33112202133132110100 |
5 | 114241111221202102 |
6 | 2124353540301040 |
7 | 136135466535060 |
oct | 17264237362420 |
9 | 3655107652286 |
10 | 1054993147152 |
11 | 37746914533a |
12 | 15056b0a1780 |
13 | 78640637bb9 |
14 | 390c1d733a0 |
15 | 1c69965c1bc |
hex | f5a27de510 |
1054993147152 has 40 divisors (see below), whose sum is σ = 3114741673536. Its totient is φ = 301426613376.
The previous prime is 1054993147051. The next prime is 1054993147171. The reversal of 1054993147152 is 2517413994501.
It is a super-2 number, since 2×10549931471522 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1054993147095 and 1054993147104.
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, 1569929943 + ... + 1569930614.
Almost surely, 21054993147152 is an apocalyptic number.
1054993147152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1054993147152 is an abundant number, since it is smaller than the sum of its proper divisors (2059748526384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054993147152 is a wasteful number, since it uses less digits than its factorization.
1054993147152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3139860575 (or 3139860569 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 1054993147152 in words is "one trillion, fifty-four billion, nine hundred ninety-three million, one hundred forty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •