Base | Representation |
---|---|
bin | 11101100100000010101011… |
… | …001000011100001110011101 |
3 | 122001100210122210102010122200 |
4 | 131210002223020130032131 |
5 | 114020222202000214323 |
6 | 1140310230303002113 |
7 | 36246433544224230 |
oct | 3544025310341635 |
9 | 561323583363580 |
10 | 130020121101213 |
11 | 384792508203a2 |
12 | 126ba92b599339 |
13 | 5771aca081035 |
14 | 24170165a9417 |
15 | 10071c5c86443 |
hex | 7640ab21c39d |
130020121101213 has 96 divisors (see below), whose sum is σ = 224429528494080. Its totient is φ = 70920733213440.
The previous prime is 130020121101197. The next prime is 130020121101251. The reversal of 130020121101213 is 312101121020031.
130020121101213 is a `hidden beast` number, since 1 + 300 + 20 + 121 + 10 + 1 + 213 = 666.
It is not a de Polignac number, because 130020121101213 - 24 = 130020121101197 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130020121100213) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1383013353 + ... + 1383107361.
It is an arithmetic number, because the mean of its divisors is an integer number (2337807588480).
Almost surely, 2130020121101213 is an apocalyptic number.
It is an amenable number.
130020121101213 is a deficient number, since it is larger than the sum of its proper divisors (94409407392867).
130020121101213 is a wasteful number, since it uses less digits than its factorization.
130020121101213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95999 (or 95996 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 130020121101213 its reverse (312101121020031), we get a palindrome (442121242121244).
The spelling of 130020121101213 in words is "one hundred thirty trillion, twenty billion, one hundred twenty-one million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •