Base | Representation |
---|---|
bin | 11110100111100001110… |
… | …00110110011010100010 |
3 | 10201120102121220201010200 |
4 | 33103300320312122202 |
5 | 114214010421030020 |
6 | 2123142135210030 |
7 | 136001605553010 |
oct | 17236070663242 |
9 | 3646377821120 |
10 | 1052013455010 |
11 | 37617a195551 |
12 | 14ba79216916 |
13 | 78287213c5b |
14 | 38cbc3358b0 |
15 | 1c572c7a590 |
hex | f4f0e366a2 |
1052013455010 has 48 divisors (see below), whose sum is σ = 3125982839616. Its totient is φ = 240460218144.
The previous prime is 1052013454967. The next prime is 1052013455023. The reversal of 1052013455010 is 105543102501.
1052013455010 is a `hidden beast` number, since 1 + 0 + 5 + 20 + 134 + 5 + 501 + 0 = 666.
It is a super-2 number, since 2×10520134550102 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 834930684 + ... + 834931943.
It is an arithmetic number, because the mean of its divisors is an integer number (65124642492).
Almost surely, 21052013455010 is an apocalyptic number.
1052013455010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1052013455010 is an abundant number, since it is smaller than the sum of its proper divisors (2073969384606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052013455010 is a wasteful number, since it uses less digits than its factorization.
1052013455010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1669862647 (or 1669862644 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 1052013455010 its reverse (105543102501), we get a palindrome (1157556557511).
The spelling of 1052013455010 in words is "one trillion, fifty-two billion, thirteen million, four hundred fifty-five thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •