Base | Representation |
---|---|
bin | 11101010001000101011… |
… | …10110111110111010111 |
3 | 10120010122100022222101220 |
4 | 32220202232313313113 |
5 | 112433434343410210 |
6 | 2045545114221423 |
7 | 132436554656001 |
oct | 16504256676727 |
9 | 3503570288356 |
10 | 1005605060055 |
11 | 358524927532 |
12 | 142a87124873 |
13 | 73a9c5a521b |
14 | 36958a0b371 |
15 | 1b258889c70 |
hex | ea22bb7dd7 |
1005605060055 has 48 divisors (see below), whose sum is σ = 1663209446112. Its totient is φ = 518814412800.
The previous prime is 1005605060011. The next prime is 1005605060063. The reversal of 1005605060055 is 5500605065001.
It is not a de Polignac number, because 1005605060055 - 210 = 1005605059031 is a prime.
It is a super-2 number, since 2×10056050600552 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1005605059998 and 1005605060025.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40017895 + ... + 40043015.
It is an arithmetic number, because the mean of its divisors is an integer number (34650196794).
Almost surely, 21005605060055 is an apocalyptic number.
1005605060055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1005605060055 is a deficient number, since it is larger than the sum of its proper divisors (657604386057).
1005605060055 is a wasteful number, since it uses less digits than its factorization.
1005605060055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27968 (or 27937 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
It can be divided in two parts, 100560 and 5060055, that added together give a palindrome (5160615).
The spelling of 1005605060055 in words is "one trillion, five billion, six hundred five million, sixty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •