Base | Representation |
---|---|
bin | 1010010111101111100010… |
… | …0110110101001011001111 |
3 | 1111101010011122211211200201 |
4 | 2211323320212311023033 |
5 | 2443311333104214211 |
6 | 40130250011034331 |
7 | 2254561214610415 |
oct | 245737046651317 |
9 | 44333148754621 |
10 | 11403014132431 |
11 | 36a6a9a224649 |
12 | 1341b9243b9a7 |
13 | 6493b83543bc |
14 | 2b5ca1b7d2b5 |
15 | 14b9429d90c1 |
hex | a5ef89b52cf |
11403014132431 has 32 divisors (see below), whose sum is σ = 12264012896000. Its totient is φ = 10570774710528.
The previous prime is 11403014132429. The next prime is 11403014132441. The reversal of 11403014132431 is 13423141030411.
It is not a de Polignac number, because 11403014132431 - 21 = 11403014132429 is a prime.
It is a super-2 number, since 2×114030141324312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11403014132431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11403014132441) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 89823880 + ... + 89950738.
It is an arithmetic number, because the mean of its divisors is an integer number (383250403000).
Almost surely, 211403014132431 is an apocalyptic number.
11403014132431 is a deficient number, since it is larger than the sum of its proper divisors (860998763569).
11403014132431 is a wasteful number, since it uses less digits than its factorization.
11403014132431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127463.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 11403014132431 its reverse (13423141030411), we get a palindrome (24826155162842).
The spelling of 11403014132431 in words is "eleven trillion, four hundred three billion, fourteen million, one hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •