Base | Representation |
---|---|
bin | 10011100101011111… |
… | …111011110010011000 |
3 | 2000021122002000112011 |
4 | 103211133323302120 |
5 | 321032214114000 |
6 | 13354450355304 |
7 | 1343101642333 |
oct | 234537736230 |
9 | 60248060464 |
10 | 21030223000 |
11 | 8a12015896 |
12 | 40aab8bb34 |
13 | 1ca1c67447 |
14 | 103705d61a |
15 | 83141c2ba |
hex | 4e57fbc98 |
21030223000 has 64 divisors (see below), whose sum is σ = 49536976320. Its totient is φ = 8356320000.
The previous prime is 21030222971. The next prime is 21030223001. The reversal of 21030223000 is 32203012.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21030223001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81364 + ... + 220636.
It is an arithmetic number, because the mean of its divisors is an integer number (774015255).
Almost surely, 221030223000 is an apocalyptic number.
21030223000 is a gapful number since it is divisible by the number (20) 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 21030223000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24768488160).
21030223000 is an abundant number, since it is smaller than the sum of its proper divisors (28506753320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21030223000 is a wasteful number, since it uses less digits than its factorization.
21030223000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139445 (or 139431 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 21030223000 its reverse (32203012), we get a palindrome (21062426012).
The spelling of 21030223000 in words is "twenty-one billion, thirty million, two hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •