Base | Representation |
---|---|
bin | 1001000111110101111001… |
… | …1000111001101101011100 |
3 | 1022111220001002122210112010 |
4 | 2101331132120321231130 |
5 | 2303314110022103200 |
6 | 33155512045511220 |
7 | 2053444661105265 |
oct | 221753630715534 |
9 | 38456032583463 |
10 | 10030332222300 |
11 | 321792705a635 |
12 | 115bb41b72510 |
13 | 579b192c0a60 |
14 | 26968373796c |
15 | 125da2ce3150 |
hex | 91f5e639b5c |
10030332222300 has 144 divisors (see below), whose sum is σ = 31266003292160. Its totient is φ = 2468016034560.
The previous prime is 10030332222269. The next prime is 10030332222311. The reversal of 10030332222300 is 322223303001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9247941 + ... + 10275459.
Almost surely, 210030332222300 is an apocalyptic number.
10030332222300 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 10030332222300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15633001646080).
10030332222300 is an abundant number, since it is smaller than the sum of its proper divisors (21235671069860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10030332222300 is a wasteful number, since it uses less digits than its factorization.
10030332222300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030052 (or 1030045 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 10030332222300 its reverse (322223303001), we get a palindrome (10352555525301).
The spelling of 10030332222300 in words is "ten trillion, thirty billion, three hundred thirty-two million, two hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •