Base | Representation |
---|---|
bin | 111100100101100111… |
… | …1010011000010011110 |
3 | 110102211200101220021000 |
4 | 1321023033103002132 |
5 | 4112431444221342 |
6 | 135434453051130 |
7 | 12254164655052 |
oct | 1711317230236 |
9 | 412750356230 |
10 | 130111320222 |
11 | 501a84a2714 |
12 | 21272026aa6 |
13 | c366c7caa0 |
14 | 64241a5c62 |
15 | 35b7a0244c |
hex | 1e4b3d309e |
130111320222 has 64 divisors (see below), whose sum is σ = 321422008320. Its totient is φ = 38742818400.
The previous prime is 130111320217. The next prime is 130111320257. The reversal of 130111320222 is 222023111031.
130111320222 is a `hidden beast` number, since 13 + 0 + 111 + 320 + 222 = 666.
It is a super-2 number, since 2×1301113202222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 130111320195 and 130111320204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2967654 + ... + 3011177.
It is an arithmetic number, because the mean of its divisors is an integer number (5022218880).
Almost surely, 2130111320222 is an apocalyptic number.
130111320222 is an abundant number, since it is smaller than the sum of its proper divisors (191310688098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130111320222 is a wasteful number, since it uses less digits than its factorization.
130111320222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5978886 (or 5978880 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 130111320222 its reverse (222023111031), we get a palindrome (352134431253).
The spelling of 130111320222 in words is "one hundred thirty billion, one hundred eleven million, three hundred twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •