Base | Representation |
---|---|
bin | 11101100101011111111000… |
… | …111010000011101001111101 |
3 | 122001201101000011201020010101 |
4 | 131211133320322003221331 |
5 | 114023342142302414323 |
6 | 1140424222131441101 |
7 | 36256606052436421 |
oct | 3545377072035175 |
9 | 561641004636111 |
10 | 130120210201213 |
11 | 38507742482661 |
12 | 12716203156191 |
13 | 577b38b188b6b |
14 | 241bbcd3c0b81 |
15 | 1009ad2c20dad |
hex | 7657f8e83a7d |
130120210201213 has 16 divisors (see below), whose sum is σ = 140327011270656. Its totient is φ = 120302235511920.
The previous prime is 130120210201211. The next prime is 130120210201237. The reversal of 130120210201213 is 312102012021031.
It is a cyclic number.
It is not a de Polignac number, because 130120210201213 - 21 = 130120210201211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130120210201211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109746981 + ... + 110926282.
It is an arithmetic number, because the mean of its divisors is an integer number (8770438204416).
Almost surely, 2130120210201213 is an apocalyptic number.
It is an amenable number.
130120210201213 is a deficient number, since it is larger than the sum of its proper divisors (10206801069443).
130120210201213 is a wasteful number, since it uses less digits than its factorization.
130120210201213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220674144.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 130120210201213 its reverse (312102012021031), we get a palindrome (442222222222244).
The spelling of 130120210201213 in words is "one hundred thirty trillion, one hundred twenty billion, two hundred ten million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •