Base | Representation |
---|---|
bin | 10011111011101110… |
… | …101111011010001101 |
3 | 2001020121220101012010 |
4 | 103323232233122031 |
5 | 322313210000323 |
6 | 13455452531433 |
7 | 1355251140240 |
oct | 237356573215 |
9 | 61217811163 |
10 | 21403203213 |
11 | 90936063a7 |
12 | 4193a80b79 |
13 | 20313083b2 |
14 | 10707cd257 |
15 | 854044c93 |
hex | 4fbbaf68d |
21403203213 has 16 divisors (see below), whose sum is σ = 32646010496. Its totient is φ = 12218549760.
The previous prime is 21403203169. The next prime is 21403203221. The reversal of 21403203213 is 31230230412.
It is not a de Polignac number, because 21403203213 - 26 = 21403203149 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 21403203213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21403203013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 471628 + ... + 515013.
It is an arithmetic number, because the mean of its divisors is an integer number (2040375656).
Almost surely, 221403203213 is an apocalyptic number.
It is an amenable number.
21403203213 is a deficient number, since it is larger than the sum of its proper divisors (11242807283).
21403203213 is a wasteful number, since it uses less digits than its factorization.
21403203213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 987684.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 21403203213 its reverse (31230230412), we get a palindrome (52633433625).
The spelling of 21403203213 in words is "twenty-one billion, four hundred three million, two hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •