Base | Representation |
---|---|
bin | 1010000111011101010000… |
… | …1011111100011011011000 |
3 | 1110101101000001001222122121 |
4 | 2201313110023330123120 |
5 | 2424220333414331412 |
6 | 35353535203031024 |
7 | 2225425004643511 |
oct | 241672413743330 |
9 | 43341001058577 |
10 | 11123230230232 |
11 | 35a937653489a |
12 | 12b790b36b474 |
13 | 628bba902953 |
14 | 2a651d8d5a08 |
15 | 14451a030107 |
hex | a1dd42fc6d8 |
11123230230232 has 16 divisors (see below), whose sum is σ = 20856464564400. Its totient is φ = 5561506346400.
The previous prime is 11123230230193. The next prime is 11123230230311. The reversal of 11123230230232 is 23203203232111.
It is a super-3 number, since 3×111232302302323 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11123230230197 and 11123230230206.
It is a congruent number.
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 in 3 ways as a sum of consecutive naturals, for example, 13160644 + ... + 13980307.
It is an arithmetic number, because the mean of its divisors is an integer number (1303529035275).
Almost surely, 211123230230232 is an apocalyptic number.
It is an amenable number.
11123230230232 is a deficient number, since it is larger than the sum of its proper divisors (9733234334168).
11123230230232 is a wasteful number, since it uses less digits than its factorization.
11123230230232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27192186 (or 27192182 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 11123230230232 its reverse (23203203232111), we get a palindrome (34326433462343).
The spelling of 11123230230232 in words is "eleven trillion, one hundred twenty-three billion, two hundred thirty million, two hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •