Base | Representation |
---|---|
bin | 11101100101100001101010… |
… | …110111011111111001101101 |
3 | 122001201112221102100102121112 |
4 | 131211201222313133321231 |
5 | 114023410101231224401 |
6 | 1140425135551041405 |
7 | 36260004326543030 |
oct | 3545415267377155 |
9 | 561645842312545 |
10 | 130122122133101 |
11 | 3850853373835a |
12 | 12716657510265 |
13 | 577b6043096c7 |
14 | 241bd312b3017 |
15 | 1009b959d93bb |
hex | 76586addfe6d |
130122122133101 has 8 divisors (see below), whose sum is σ = 148725215279040. Its totient is φ = 111522583626048.
The previous prime is 130122122133079. The next prime is 130122122133103. The reversal of 130122122133101 is 101331221221031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130122122133101 - 242 = 125724075621997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130122122133103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 888581276 + ... + 888727701.
It is an arithmetic number, because the mean of its divisors is an integer number (18590651909880).
Almost surely, 2130122122133101 is an apocalyptic number.
It is an amenable number.
130122122133101 is a deficient number, since it is larger than the sum of its proper divisors (18603093145939).
130122122133101 is a wasteful number, since it uses less digits than its factorization.
130122122133101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1777319443.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 130122122133101 its reverse (101331221221031), we get a palindrome (231453343354132).
The spelling of 130122122133101 in words is "one hundred thirty trillion, one hundred twenty-two billion, one hundred twenty-two million, one hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •