Base | Representation |
---|---|
bin | 10011100011111000… |
… | …000110000111010011 |
3 | 2000012201212001202221 |
4 | 103203320012013103 |
5 | 321003232033243 |
6 | 13352035121511 |
7 | 1342321400632 |
oct | 234370060723 |
9 | 60181761687 |
10 | 21003002323 |
11 | 89a8713566 |
12 | 40a1a43297 |
13 | 1c99426534 |
14 | 10335b5519 |
15 | 82dd41bed |
hex | 4e3e061d3 |
21003002323 has 8 divisors (see below), whose sum is σ = 21027671280. Its totient is φ = 20978351520.
The previous prime is 21003002281. The next prime is 21003002389. The reversal of 21003002323 is 32320030012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21003002323 - 217 = 21002871251 is a prime.
It is a super-2 number, since 2×210030023232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21003002297 and 21003002306.
It is not an unprimeable number, because it can be changed into a prime (21003002123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4234561 + ... + 4239517.
It is an arithmetic number, because the mean of its divisors is an integer number (2628458910).
Almost surely, 221003002323 is an apocalyptic number.
21003002323 is a deficient number, since it is larger than the sum of its proper divisors (24668957).
21003002323 is a wasteful number, since it uses less digits than its factorization.
21003002323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9077.
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 21003002323 its reverse (32320030012), we get a palindrome (53323032335).
The spelling of 21003002323 in words is "twenty-one billion, three million, two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •