Base | Representation |
---|---|
bin | 10101001111010001… |
… | …00110000101101101 |
3 | 1002102122120111002020 |
4 | 22213220212011231 |
5 | 141323001341222 |
6 | 5123240220353 |
7 | 552363362262 |
oct | 124750460555 |
9 | 32378514066 |
10 | 11402371437 |
11 | 4921383476 |
12 | 226276a6b9 |
13 | 10c93b9462 |
14 | 7a24d1269 |
15 | 46b07065c |
hex | 2a7a2616d |
11402371437 has 64 divisors (see below), whose sum is σ = 16270007040. Its totient is φ = 7094697984.
The previous prime is 11402371403. The next prime is 11402371439. The reversal of 11402371437 is 73417320411.
11402371437 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11402371437 - 211 = 11402369389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11402371398 and 11402371407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11402371439) 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 63 ways as a sum of consecutive naturals, for example, 69953118 + ... + 69953280.
It is an arithmetic number, because the mean of its divisors is an integer number (254218860).
Almost surely, 211402371437 is an apocalyptic number.
It is an amenable number.
11402371437 is a deficient number, since it is larger than the sum of its proper divisors (4867635603).
11402371437 is a wasteful number, since it uses less digits than its factorization.
11402371437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462.
The product of its (nonzero) digits is 14112, while the sum is 33.
Adding to 11402371437 its reverse (73417320411), we get a palindrome (84819691848).
The spelling of 11402371437 in words is "eleven billion, four hundred two million, three hundred seventy-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •