Base | Representation |
---|---|
bin | 100011110010111… |
… | …0101010011100101 |
3 | 10002201002012110101 |
4 | 1013211311103211 |
5 | 4424440200010 |
6 | 315103424101 |
7 | 41523116200 |
oct | 10745652345 |
9 | 3081065411 |
10 | 1201100005 |
11 | 566a98236 |
12 | 2962b5031 |
13 | 161abb081 |
14 | b5738937 |
15 | 706a673a |
hex | 479754e5 |
1201100005 has 24 divisors (see below), whose sum is σ = 1678831488. Its totient is φ = 822534048.
The previous prime is 1201099981. The next prime is 1201100023. The reversal of 1201100005 is 5000011021.
It is a happy number.
It is not a de Polignac number, because 1201100005 - 215 = 1201067237 is a prime.
It is a super-2 number, since 2×12011000052 = 2885282444022000050, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201099964 and 1201100000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 214552 + ... + 220078.
It is an arithmetic number, because the mean of its divisors is an integer number (69951312).
Almost surely, 21201100005 is an apocalyptic number.
It is an amenable number.
1201100005 is a deficient number, since it is larger than the sum of its proper divisors (477731483).
1201100005 is an equidigital number, since it uses as much as digits as its factorization.
1201100005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6433 (or 6426 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 10.
The square root of 1201100005 is about 34656.8897190732. The cubic root of 1201100005 is about 1062.9831727233.
Adding to 1201100005 its reverse (5000011021), we get a palindrome (6201111026).
The spelling of 1201100005 in words is "one billion, two hundred one million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •