Base | Representation |
---|---|
bin | 111100100101111110… |
… | …0101100110100011100 |
3 | 110102212111210120211201 |
4 | 1321023330230310130 |
5 | 4112443021103200 |
6 | 135440000125244 |
7 | 12254401066021 |
oct | 1711374546434 |
9 | 412774716751 |
10 | 130123222300 |
11 | 50204191945 |
12 | 21276006824 |
13 | c369589336 |
14 | 64259c3548 |
15 | 35b8aa3c6a |
hex | 1e4bf2cd1c |
130123222300 has 72 divisors (see below), whose sum is σ = 291572449280. Its totient is φ = 50353617600.
The previous prime is 130123222231. The next prime is 130123222301. The reversal of 130123222300 is 3222321031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130123222301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13780981 + ... + 13790419.
Almost surely, 2130123222300 is an apocalyptic number.
130123222300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130123222300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145786224640).
130123222300 is an abundant number, since it is smaller than the sum of its proper divisors (161449226980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130123222300 is a wasteful number, since it uses less digits than its factorization.
130123222300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13931 (or 13924 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 130123222300 its reverse (3222321031), we get a palindrome (133345543331).
The spelling of 130123222300 in words is "one hundred thirty billion, one hundred twenty-three million, two hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •