Base | Representation |
---|---|
bin | 11101100100000011100110… |
… | …010000010001100000011001 |
3 | 122001100220012220212022222121 |
4 | 131210003212100101200121 |
5 | 114020231214412311301 |
6 | 1140310512535021241 |
7 | 36246500250266200 |
oct | 3544034620214031 |
9 | 561326186768877 |
10 | 130021113010201 |
11 | 3847970a718296 |
12 | 126bab6780a821 |
13 | 5771c2771752a |
14 | 24170ac20c237 |
15 | 1007232dba3a1 |
hex | 7640e6411819 |
130021113010201 has 24 divisors (see below), whose sum is σ = 153835645176000. Its totient is φ = 109541322130464.
The previous prime is 130021113010183. The next prime is 130021113010247. The reversal of 130021113010201 is 102010311120031.
It is a happy number.
It is not a de Polignac number, because 130021113010201 - 231 = 130018965526553 is a prime.
It is a super-2 number, since 2×1300211130102012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130021113010601) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15942135 + ... + 22675843.
It is an arithmetic number, because the mean of its divisors is an integer number (6409818549000).
Almost surely, 2130021113010201 is an apocalyptic number.
It is an amenable number.
130021113010201 is a deficient number, since it is larger than the sum of its proper divisors (23814532165799).
130021113010201 is an equidigital number, since it uses as much as digits as its factorization.
130021113010201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6740461 (or 6740454 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 130021113010201 its reverse (102010311120031), we get a palindrome (232031424130232).
The spelling of 130021113010201 in words is "one hundred thirty trillion, twenty-one billion, one hundred thirteen million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •