Base | Representation |
---|---|
bin | 1011101100110111001… |
… | …1011100010010010000 |
3 | 201012212112001121120021 |
4 | 2323031303130102100 |
5 | 11243142423410341 |
6 | 232203052153224 |
7 | 20344331641315 |
oct | 2731563342220 |
9 | 635775047507 |
10 | 201021310096 |
11 | 7828631a632 |
12 | 32b61768814 |
13 | 15c57aaab89 |
14 | 9a2d9b8d0c |
15 | 5367e649d1 |
hex | 2ecdcdc490 |
201021310096 has 40 divisors (see below), whose sum is σ = 390292321280. Its totient is φ = 100300944384.
The previous prime is 201021310081. The next prime is 201021310109. The reversal of 201021310096 is 690013120102.
201021310096 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2010213100962 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201021310096.
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 7 ways as a sum of consecutive naturals, for example, 15976960 + ... + 15989536.
It is an arithmetic number, because the mean of its divisors is an integer number (9757308032).
Almost surely, 2201021310096 is an apocalyptic number.
It is an amenable number.
201021310096 is a deficient number, since it is larger than the sum of its proper divisors (189271011184).
201021310096 is a wasteful number, since it uses less digits than its factorization.
201021310096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14591 (or 14585 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 201021310096 its reverse (690013120102), we get a palindrome (891034430198).
The spelling of 201021310096 in words is "two hundred one billion, twenty-one million, three hundred ten thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •