Base | Representation |
---|---|
bin | 1010010111101000111001… |
… | …1001011010011110100111 |
3 | 1111100221120110212211111220 |
4 | 2211322032121122132213 |
5 | 2443244210422332221 |
6 | 40125353114431423 |
7 | 2254466106650460 |
oct | 245721631323647 |
9 | 44327513784456 |
10 | 11401232230311 |
11 | 36a6265401170 |
12 | 1341775732573 |
13 | 64919312ca51 |
14 | 2b5b73257d67 |
15 | 14b88b3580c6 |
hex | a5e8e65a7a7 |
11401232230311 has 32 divisors (see below), whose sum is σ = 18952899698688. Its totient is φ = 5922654927840.
The previous prime is 11401232230309. The next prime is 11401232230373. The reversal of 11401232230311 is 11303223210411.
It is not a de Polignac number, because 11401232230311 - 21 = 11401232230309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11401232230301) 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, 28040910 + ... + 28444596.
It is an arithmetic number, because the mean of its divisors is an integer number (592278115584).
Almost surely, 211401232230311 is an apocalyptic number.
11401232230311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11401232230311 is a deficient number, since it is larger than the sum of its proper divisors (7551667468377).
11401232230311 is a wasteful number, since it uses less digits than its factorization.
11401232230311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525971.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 11401232230311 its reverse (11303223210411), we get a palindrome (22704455440722).
It can be divided in two parts, 114012 and 32230311, that added together give a palindrome (32344323).
The spelling of 11401232230311 in words is "eleven trillion, four hundred one billion, two hundred thirty-two million, two hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •