Base | Representation |
---|---|
bin | 1010000110110111001111… |
… | …0010111010111100100000 |
3 | 1110100101122200121020010121 |
4 | 2201231303302322330200 |
5 | 2424033432404420412 |
6 | 35345130301210024 |
7 | 2224614033654202 |
oct | 241556362727440 |
9 | 43311580536117 |
10 | 11113023123232 |
11 | 35a5008923278 |
12 | 12b5940b60914 |
13 | 627c52040374 |
14 | 2a5c32060772 |
15 | 14411ddb2107 |
hex | a1b73cbaf20 |
11113023123232 has 12 divisors (see below), whose sum is σ = 21878764273926. Its totient is φ = 5556511561600.
The previous prime is 11113023123199. The next prime is 11113023123253. The reversal of 11113023123232 is 23232132031111.
It can be written as a sum of positive squares in only one way, i.e., 10244838971536 + 868184151696 = 3200756^2 + 931764^2 .
It is a super-3 number, since 3×111130231232323 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11113023123197 and 11113023123206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 173640986269 + ... + 173640986332.
Almost surely, 211113023123232 is an apocalyptic number.
It is an amenable number.
11113023123232 is a deficient number, since it is larger than the sum of its proper divisors (10765741150694).
11113023123232 is an equidigital number, since it uses as much as digits as its factorization.
11113023123232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347281972611 (or 347281972603 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 11113023123232 its reverse (23232132031111), we get a palindrome (34345155154343).
The spelling of 11113023123232 in words is "eleven trillion, one hundred thirteen billion, twenty-three million, one hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •