Base | Representation |
---|---|
bin | 10101010001010111… |
… | …11010111011000101 |
3 | 1002110212210010221022 |
4 | 22220223322323011 |
5 | 141342011123141 |
6 | 5125110400525 |
7 | 552666400115 |
oct | 125053727305 |
9 | 32425703838 |
10 | 11420020421 |
11 | 4930338407 |
12 | 2268660145 |
13 | 10ccc58744 |
14 | 7a49a7045 |
15 | 46c8a9b4b |
hex | 2a8afaec5 |
11420020421 has 8 divisors (see below), whose sum is σ = 11922313920. Its totient is φ = 10918207872.
The previous prime is 11420020327. The next prime is 11420020483. The reversal of 11420020421 is 12402002411.
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 11420020421 - 210 = 11420019397 is a prime.
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 11420020421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11420020621) 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 7 ways as a sum of consecutive naturals, for example, 71276 + ... + 167093.
It is an arithmetic number, because the mean of its divisors is an integer number (1490289240).
Almost surely, 211420020421 is an apocalyptic number.
It is an amenable number.
11420020421 is a deficient number, since it is larger than the sum of its proper divisors (502293499).
11420020421 is a wasteful number, since it uses less digits than its factorization.
11420020421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240475.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 11420020421 its reverse (12402002411), we get a palindrome (23822022832).
The spelling of 11420020421 in words is "eleven billion, four hundred twenty million, twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •