Base | Representation |
---|---|
bin | 1101101111111001100010… |
… | …01100010111110010100100 |
3 | 10222001020220201200221001010 |
4 | 12313330301030113302210 |
5 | 12430314342112421200 |
6 | 144144521111502220 |
7 | 6240161255632344 |
oct | 667746114276244 |
9 | 128036821627033 |
10 | 30233100123300 |
11 | 96a6870931858 |
12 | 3483464087970 |
13 | 13b3c7a1926a9 |
14 | 76740b502d24 |
15 | 3766740e7150 |
hex | 1b7f31317ca4 |
30233100123300 has 144 divisors (see below), whose sum is σ = 90306056486912. Its totient is φ = 7801238044800.
The previous prime is 30233100123293. The next prime is 30233100123319. The reversal of 30233100123300 is 332100133203.
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, 87275037 + ... + 87620763.
Almost surely, 230233100123300 is an apocalyptic number.
30233100123300 is a gapful number since it is divisible by the number (30) 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 30233100123300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45153028243456).
30233100123300 is an abundant number, since it is smaller than the sum of its proper divisors (60072956363612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30233100123300 is a wasteful number, since it uses less digits than its factorization.
30233100123300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355178 (or 355171 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30233100123300 its reverse (332100133203), we get a palindrome (30565200256503).
The spelling of 30233100123300 in words is "thirty trillion, two hundred thirty-three billion, one hundred million, one hundred twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •