Base | Representation |
---|---|
bin | 111100100011010010… |
… | …1010010111111100010 |
3 | 110102122020102001000000 |
4 | 1321012211102333202 |
5 | 4112301444413442 |
6 | 135423022440430 |
7 | 12252225654426 |
oct | 1710645227742 |
9 | 412566361000 |
10 | 130033201122 |
11 | 50168396680 |
12 | 2124ba33116 |
13 | c353a2a876 |
14 | 6417a6cb86 |
15 | 35b0c20d4c |
hex | 1e46952fe2 |
130033201122 has 112 divisors (see below), whose sum is σ = 319837857120. Its totient is φ = 39303792000.
The previous prime is 130033201087. The next prime is 130033201147. The reversal of 130033201122 is 221102330031.
130033201122 is a `hidden beast` number, since 1 + 300 + 332 + 0 + 11 + 22 = 666.
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 = 130033201095 and 130033201104.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 6421129 + ... + 6441347.
Almost surely, 2130033201122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130033201122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159918928560).
130033201122 is an abundant number, since it is smaller than the sum of its proper divisors (189804655998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130033201122 is a wasteful number, since it uses less digits than its factorization.
130033201122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20651 (or 20636 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 130033201122 its reverse (221102330031), we get a palindrome (351135531153).
The spelling of 130033201122 in words is "one hundred thirty billion, thirty-three million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •