Base | Representation |
---|---|
bin | 10011101100000011… |
… | …001111000101111101 |
3 | 2000120021220101212110 |
4 | 103230003033011331 |
5 | 321243333443123 |
6 | 13413414324233 |
7 | 1345605141300 |
oct | 235403170575 |
9 | 60507811773 |
10 | 21140140413 |
11 | 8a69070427 |
12 | 411b959679 |
13 | 1cbb971032 |
14 | 10478b2b37 |
15 | 83add0493 |
hex | 4ec0cf17d |
21140140413 has 24 divisors (see below), whose sum is σ = 33008882400. Its totient is φ = 11998993440.
The previous prime is 21140140393. The next prime is 21140140459. The reversal of 21140140413 is 31404104112.
It is not a de Polignac number, because 21140140413 - 26 = 21140140349 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 21140140413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21140140493) 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, 460683 + ... + 504488.
It is an arithmetic number, because the mean of its divisors is an integer number (1375370100).
Almost surely, 221140140413 is an apocalyptic number.
It is an amenable number.
21140140413 is a deficient number, since it is larger than the sum of its proper divisors (11868741987).
21140140413 is a wasteful number, since it uses less digits than its factorization.
21140140413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965337 (or 965330 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 21140140413 its reverse (31404104112), we get a palindrome (52544244525).
The spelling of 21140140413 in words is "twenty-one billion, one hundred forty million, one hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •