Base | Representation |
---|---|
bin | 10110110010011100001000… |
… | …110110000001001000011100 |
3 | 111010212020121211202002010101 |
4 | 112302130020312001020130 |
5 | 101114024113304332200 |
6 | 553053523540350444 |
7 | 30052613402612203 |
oct | 2662341066011034 |
9 | 433766554662111 |
10 | 100223210230300 |
11 | 29a304743a7993 |
12 | b2a7b1a3a5424 |
13 | 43c0014c50bb1 |
14 | 1aa6b876a823a |
15 | b8c08072e26a |
hex | 5b2708d8121c |
100223210230300 has 36 divisors (see below), whose sum is σ = 217771664073880. Its totient is φ = 40036325958720.
The previous prime is 100223210230193. The next prime is 100223210230309. The reversal of 100223210230300 is 3032012322001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100223210230309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 661900590 + ... + 662051989.
Almost surely, 2100223210230300 is an apocalyptic number.
100223210230300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100223210230300 is an abundant number, since it is smaller than the sum of its proper divisors (117548453843580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100223210230300 is a wasteful number, since it uses less digits than its factorization.
100223210230300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1323953350 (or 1323953343 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 100223210230300 its reverse (3032012322001), we get a palindrome (103255222552301).
The spelling of 100223210230300 in words is "one hundred trillion, two hundred twenty-three billion, two hundred ten million, two hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •