Base | Representation |
---|---|
bin | 111100101000111011… |
… | …0101110111010011110 |
3 | 110110010102021100010102 |
4 | 1321101312232322132 |
5 | 4113143403240220 |
6 | 135453500141102 |
7 | 12260013316304 |
oct | 1712166567236 |
9 | 413112240112 |
10 | 130222321310 |
11 | 50255118454 |
12 | 212a3237792 |
13 | c383c759c3 |
14 | 6434c1c274 |
15 | 35c262b775 |
hex | 1e51daee9e |
130222321310 has 8 divisors (see below), whose sum is σ = 234400178376. Its totient is φ = 52088928520.
The previous prime is 130222321283. The next prime is 130222321331. The reversal of 130222321310 is 13123222031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1302223213102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 6511116056 + ... + 6511116075.
It is an arithmetic number, because the mean of its divisors is an integer number (29300022297).
Almost surely, 2130222321310 is an apocalyptic number.
130222321310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130222321310 is a deficient number, since it is larger than the sum of its proper divisors (104177857066).
130222321310 is a wasteful number, since it uses less digits than its factorization.
130222321310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13022232138.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 130222321310 its reverse (13123222031), we get a palindrome (143345543341).
It can be divided in two parts, 13022 and 2321310, that added together give a palindrome (2334332).
The spelling of 130222321310 in words is "one hundred thirty billion, two hundred twenty-two million, three hundred twenty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •