Base | Representation |
---|---|
bin | 11110101110000010100… |
… | …11001010110000111000 |
3 | 10201220110022022100202201 |
4 | 33113001103022300320 |
5 | 114243141030440112 |
6 | 2124521122435544 |
7 | 136154344044364 |
oct | 17270123126070 |
9 | 3656408270681 |
10 | 1055510015032 |
11 | 377703982880 |
12 | 150694202bb4 |
13 | 786c3747895 |
14 | 3913087a2a4 |
15 | 1c6c9c08257 |
hex | f5c14cac38 |
1055510015032 has 64 divisors (see below), whose sum is σ = 2253160488960. Its totient is φ = 458857660800.
The previous prime is 1055510015017. The next prime is 1055510015107. The reversal of 1055510015032 is 2305100155501.
It is a super-2 number, since 2×10555100150322 (a number of 25 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 (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17844418 + ... + 17903470.
It is an arithmetic number, because the mean of its divisors is an integer number (35205632640).
Almost surely, 21055510015032 is an apocalyptic number.
It is an amenable number.
1055510015032 is an abundant number, since it is smaller than the sum of its proper divisors (1197650473928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055510015032 is a wasteful number, since it uses less digits than its factorization.
1055510015032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67924 (or 67920 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 1055510015032 in words is "one trillion, fifty-five billion, five hundred ten million, fifteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.451 sec. • engine limits •