Base | Representation |
---|---|
bin | 111001010111111110… |
… | …1000101101011010011 |
3 | 102210000210102221212001 |
4 | 1302233331011223103 |
5 | 4004314021023443 |
6 | 132334041414431 |
7 | 11621200110262 |
oct | 1625775055323 |
9 | 383023387761 |
10 | 123211111123 |
11 | 48287507471 |
12 | 1ba6719a417 |
13 | b807546419 |
14 | 5d6b9c45d9 |
15 | 3311d4ad4d |
hex | 1caff45ad3 |
123211111123 has 16 divisors (see below), whose sum is σ = 132931925280. Its totient is φ = 113784985600.
The previous prime is 123211111109. The next prime is 123211111129. The reversal of 123211111123 is 321111112321.
It is a cyclic number.
It is not a de Polignac number, because 123211111123 - 29 = 123211110611 is a prime.
It is a super-2 number, since 2×1232111111232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123211111123.
It is not an unprimeable number, because it can be changed into a prime (123211111129) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 112618 + ... + 509023.
It is an arithmetic number, because the mean of its divisors is an integer number (8308245330).
Almost surely, 2123211111123 is an apocalyptic number.
123211111123 is a deficient number, since it is larger than the sum of its proper divisors (9720814157).
123211111123 is a wasteful number, since it uses less digits than its factorization.
123211111123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621878.
The product of its digits is 72, while the sum is 19.
Adding to 123211111123 its reverse (321111112321), we get a palindrome (444322223444).
The spelling of 123211111123 in words is "one hundred twenty-three billion, two hundred eleven million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •