Base | Representation |
---|---|
bin | 111100100101111010… |
… | …1011010101111000111 |
3 | 110102212101012121002011 |
4 | 1321023311122233013 |
5 | 4112442024010343 |
6 | 135435451155051 |
7 | 12254345625136 |
oct | 1711365325707 |
9 | 412771177064 |
10 | 130121313223 |
11 | 502030a85a0 |
12 | 21275445a87 |
13 | c36906b3c5 |
14 | 642564791d |
15 | 35b882829d |
hex | 1e4bd5abc7 |
130121313223 has 16 divisors (see below), whose sum is σ = 148940692992. Its totient is φ = 112523796000.
The previous prime is 130121313209. The next prime is 130121313241. The reversal of 130121313223 is 322313121031.
It is not a de Polignac number, because 130121313223 - 25 = 130121313191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130121313194 and 130121313203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130121313523) 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 15 ways as a sum of consecutive naturals, for example, 1374963 + ... + 1466548.
It is an arithmetic number, because the mean of its divisors is an integer number (9308793312).
Almost surely, 2130121313223 is an apocalyptic number.
130121313223 is a deficient number, since it is larger than the sum of its proper divisors (18819379769).
130121313223 is a wasteful number, since it uses less digits than its factorization.
130121313223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2841726.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 130121313223 its reverse (322313121031), we get a palindrome (452434434254).
It can be divided in two parts, 130121 and 313223, that added together give a palindrome (443344).
The spelling of 130121313223 in words is "one hundred thirty billion, one hundred twenty-one million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •