Base | Representation |
---|---|
bin | 10110111000000001010011… |
… | …100010110000000100011100 |
3 | 111012012220111222200101112112 |
4 | 112320001103202300010130 |
5 | 101141320023140411340 |
6 | 553550030450453152 |
7 | 30122411125255112 |
oct | 2670012342600434 |
9 | 435186458611475 |
10 | 100606715560220 |
11 | 2a069083138541 |
12 | b34a3095941b8 |
13 | 441a232198c0c |
14 | 1abb568d2dab2 |
15 | b97028ebd065 |
hex | 5b80538b011c |
100606715560220 has 96 divisors (see below), whose sum is σ = 221864838074880. Its totient is φ = 38287070357760.
The previous prime is 100606715560193. The next prime is 100606715560229. The reversal of 100606715560220 is 22065517606001.
It is a super-2 number, since 2×1006067155602202 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100606715560229) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3906230 + ... + 14712989.
It is an arithmetic number, because the mean of its divisors is an integer number (2311092063280).
Almost surely, 2100606715560220 is an apocalyptic number.
100606715560220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100606715560220 is an abundant number, since it is smaller than the sum of its proper divisors (121258122514660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100606715560220 is a wasteful number, since it uses less digits than its factorization.
100606715560220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18619435 (or 18619433 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 41.
The spelling of 100606715560220 in words is "one hundred trillion, six hundred six billion, seven hundred fifteen million, five hundred sixty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •