Base | Representation |
---|---|
bin | 111001011000010101… |
… | …1001111110001101000 |
3 | 102210001122012200220210 |
4 | 1302300223033301220 |
5 | 4004330120223422 |
6 | 132335153021120 |
7 | 11621405004231 |
oct | 1626053176150 |
9 | 383048180823 |
10 | 123223211112 |
11 | 48293321361 |
12 | 1ba6b2547a0 |
13 | b809bc1a91 |
14 | 5d6d454088 |
15 | 3312e3b10c |
hex | 1cb0acfc68 |
123223211112 has 32 divisors (see below), whose sum is σ = 308066724000. Its totient is φ = 41073244224.
The previous prime is 123223211107. The next prime is 123223211113. The reversal of 123223211112 is 211112322321.
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (123223211113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1437639 + ... + 1520937.
It is an arithmetic number, because the mean of its divisors is an integer number (9627085125).
Almost surely, 2123223211112 is an apocalyptic number.
123223211112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
123223211112 is an abundant number, since it is smaller than the sum of its proper divisors (184843512888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123223211112 is a wasteful number, since it uses less digits than its factorization.
123223211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144945 (or 144941 counting only the distinct ones).
The product of its digits is 288, while the sum is 21.
Adding to 123223211112 its reverse (211112322321), we get a palindrome (334335533433).
The spelling of 123223211112 in words is "one hundred twenty-three billion, two hundred twenty-three million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •