Base | Representation |
---|---|
bin | 10011111011111010… |
… | …010010011010000110 |
3 | 2001020211121011100220 |
4 | 103323322102122012 |
5 | 322314443331100 |
6 | 13500041445210 |
7 | 1355315645154 |
oct | 237372223206 |
9 | 61224534326 |
10 | 21406230150 |
11 | 90952935a8 |
12 | 4194aa0806 |
13 | 2031b28096 |
14 | 1070d7a3d4 |
15 | 854441aa0 |
hex | 4fbe92686 |
21406230150 has 48 divisors (see below), whose sum is σ = 53131313664. Its totient is φ = 5703611680.
The previous prime is 21406230149. The next prime is 21406230151. The reversal of 21406230150 is 5103260412.
It is an interprime number because it is at equal distance from previous prime (21406230149) and next prime (21406230151).
It is a self number, because there is not a number n which added to its sum of digits gives 21406230150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21406230151) 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 23 ways as a sum of consecutive naturals, for example, 125107 + ... + 241793.
It is an arithmetic number, because the mean of its divisors is an integer number (1106902368).
Almost surely, 221406230150 is an apocalyptic number.
21406230150 is an abundant number, since it is smaller than the sum of its proper divisors (31725083514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21406230150 is a wasteful number, since it uses less digits than its factorization.
21406230150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117925 (or 117920 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 21406230150 its reverse (5103260412), we get a palindrome (26509490562).
The spelling of 21406230150 in words is "twenty-one billion, four hundred six million, two hundred thirty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •