Base | Representation |
---|---|
bin | 1010010011000110101100… |
… | …1111110111000100111011 |
3 | 1111002111111112221121120102 |
4 | 2210301223033313010323 |
5 | 2441010141234041443 |
6 | 40025511210150015 |
7 | 2246040515244644 |
oct | 244615317670473 |
9 | 44074445847512 |
10 | 11323333112123 |
11 | 367622038574a |
12 | 132a65542230b |
13 | 641a2a334286 |
14 | 2b20a35186cb |
15 | 14982c527cb8 |
hex | a4c6b3f713b |
11323333112123 has 32 divisors (see below), whose sum is σ = 11989206835200. Its totient is φ = 10676861306496.
The previous prime is 11323333112101. The next prime is 11323333112129. The reversal of 11323333112123 is 32121133332311.
It is a cyclic number.
It is not a de Polignac number, because 11323333112123 - 230 = 11322259370299 is a prime.
It is a super-2 number, since 2×113233331121232 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11323333112129) 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, 1878141473 + ... + 1878147501.
It is an arithmetic number, because the mean of its divisors is an integer number (374662713600).
Almost surely, 211323333112123 is an apocalyptic number.
11323333112123 is a deficient number, since it is larger than the sum of its proper divisors (665873723077).
11323333112123 is a wasteful number, since it uses less digits than its factorization.
11323333112123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8891.
The product of its digits is 5832, while the sum is 29.
Adding to 11323333112123 its reverse (32121133332311), we get a palindrome (43444466444434).
The spelling of 11323333112123 in words is "eleven trillion, three hundred twenty-three billion, three hundred thirty-three million, one hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •