Base | Representation |
---|---|
bin | 1010011110010100011101… |
… | …10101011111111100011100 |
3 | 10000112211122110010121102200 |
4 | 11033022032311133330130 |
5 | 11004324024310432200 |
6 | 120552432041051500 |
7 | 4565002463366646 |
oct | 517121665377434 |
9 | 100484573117380 |
10 | 23032011030300 |
11 | 737a903868658 |
12 | 26bb911a86b90 |
13 | cb0ba8a1588c |
14 | 598a806c9896 |
15 | 29e1aea44800 |
hex | 14f28ed5ff1c |
23032011030300 has 108 divisors (see below), whose sum is σ = 72255283865856. Its totient is φ = 6136533216000.
The previous prime is 23032011030299. The next prime is 23032011030307. The reversal of 23032011030300 is 303011023032.
23032011030300 is a `hidden beast` number, since 2 + 3 + 0 + 320 + 1 + 10 + 30 + 300 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23032011030307) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 10081009 + ... + 12152808.
Almost surely, 223032011030300 is an apocalyptic number.
23032011030300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23032011030300 is an abundant number, since it is smaller than the sum of its proper divisors (49223272835556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23032011030300 is a wasteful number, since it uses less digits than its factorization.
23032011030300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22234988 (or 22234978 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 23032011030300 its reverse (303011023032), we get a palindrome (23335022053332).
The spelling of 23032011030300 in words is "twenty-three trillion, thirty-two billion, eleven million, thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •