Base | Representation |
---|---|
bin | 1001001001011100010000… |
… | …01011101010100110001010 |
3 | 2122020000220220111122211120 |
4 | 10210232020023222212022 |
5 | 10114033240322402402 |
6 | 110440553043140110 |
7 | 4144206505662456 |
oct | 444561013524612 |
9 | 78200826448746 |
10 | 20115616606602 |
11 | 6455a92185890 |
12 | 230a65b374636 |
13 | b2bb82300aaa |
14 | 4d785b36d666 |
15 | 24d3c00d33bc |
hex | 124b882ea98a |
20115616606602 has 64 divisors (see below), whose sum is σ = 46002186510336. Its totient is φ = 5804467162560.
The previous prime is 20115616606601. The next prime is 20115616606639. The reversal of 20115616606602 is 20660661651102.
It is not an unprimeable number, because it can be changed into a prime (20115616606601) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 29373133 + ... + 30050160.
It is an arithmetic number, because the mean of its divisors is an integer number (718784164224).
Almost surely, 220115616606602 is an apocalyptic number.
20115616606602 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20115616606602 is an abundant number, since it is smaller than the sum of its proper divisors (25886569903734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20115616606602 is a wasteful number, since it uses less digits than its factorization.
20115616606602 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59423555.
The product of its (nonzero) digits is 155520, while the sum is 42.
The spelling of 20115616606602 in words is "twenty trillion, one hundred fifteen billion, six hundred sixteen million, six hundred six thousand, six hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •