Base | Representation |
---|---|
bin | 111100101000101000… |
… | …0111001101111111111 |
3 | 110110002201121111102220 |
4 | 1321101100321233333 |
5 | 4113133333413343 |
6 | 135452503420423 |
7 | 12256533113436 |
oct | 1712120715777 |
9 | 413081544386 |
10 | 130212404223 |
11 | 5024a564610 |
12 | 2129ba54713 |
13 | c381bb2ac5 |
14 | 643379a11d |
15 | 35c181d183 |
hex | 1e51439bff |
130212404223 has 32 divisors (see below), whose sum is σ = 190240592640. Its totient is φ = 78566941440.
The previous prime is 130212404219. The next prime is 130212404233. The reversal of 130212404223 is 322404212031.
It is a happy number.
It is not a de Polignac number, because 130212404223 - 22 = 130212404219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130212404193 and 130212404202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130212404233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8803248 + ... + 8818026.
It is an arithmetic number, because the mean of its divisors is an integer number (5945018520).
Almost surely, 2130212404223 is an apocalyptic number.
130212404223 is a deficient number, since it is larger than the sum of its proper divisors (60028188417).
130212404223 is a wasteful number, since it uses less digits than its factorization.
130212404223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15959.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 130212404223 its reverse (322404212031), we get a palindrome (452616616254).
It can be divided in two parts, 130212 and 404223, that added together give a palindrome (534435).
The spelling of 130212404223 in words is "one hundred thirty billion, two hundred twelve million, four hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •