Base | Representation |
---|---|
bin | 111100100101101001… |
… | …0101010001000000111 |
3 | 110102211202001122202200 |
4 | 1321023102222020013 |
5 | 4112432210414343 |
6 | 135434524005543 |
7 | 12254205314424 |
oct | 1711322521007 |
9 | 412752048680 |
10 | 130112201223 |
11 | 501a8a44614 |
12 | 212723908b3 |
13 | c3671caaa4 |
14 | 6424354d4b |
15 | 35b7b284d3 |
hex | 1e4b4aa207 |
130112201223 has 12 divisors (see below), whose sum is σ = 193019302008. Its totient is φ = 84397103280.
The previous prime is 130112201209. The next prime is 130112201239. The reversal of 130112201223 is 322102211031.
130112201223 is a `hidden beast` number, since 130 + 112 + 201 + 223 = 666.
It is not a de Polignac number, because 130112201223 - 24 = 130112201207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130112201196 and 130112201205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130112201293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 195363333 + ... + 195363998.
It is an arithmetic number, because the mean of its divisors is an integer number (16084941834).
Almost surely, 2130112201223 is an apocalyptic number.
130112201223 is a deficient number, since it is larger than the sum of its proper divisors (62907100785).
130112201223 is a wasteful number, since it uses less digits than its factorization.
130112201223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390727374 (or 390727371 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 130112201223 its reverse (322102211031), we get a palindrome (452214412254).
The spelling of 130112201223 in words is "one hundred thirty billion, one hundred twelve million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •