Base | Representation |
---|---|
bin | 11100000010011100010010… |
… | …000111100010010111100011 |
3 | 121011121121200122202101202211 |
4 | 130002130102013202113203 |
5 | 112130330222130013443 |
6 | 1114133132150222551 |
7 | 34655035551426340 |
oct | 3402342207422743 |
9 | 534547618671684 |
10 | 123313110001123 |
11 | 36322883914059 |
12 | 119b6aa7054a57 |
13 | 53a64b7b92b93 |
14 | 226455a2a97c7 |
15 | e3c9cc48819d |
hex | 7027121e25e3 |
123313110001123 has 16 divisors (see below), whose sum is σ = 142915275707904. Its totient is φ = 104207468742720.
The previous prime is 123313110001063. The next prime is 123313110001129. The reversal of 123313110001123 is 321100011313321.
It is not a de Polignac number, because 123313110001123 - 225 = 123313076446691 is a prime.
It is a super-2 number, since 2×1233131100011232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123313110001094 and 123313110001103.
It is not an unprimeable number, because it can be changed into a prime (123313110001129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69729036 + ... + 71475622.
It is an arithmetic number, because the mean of its divisors is an integer number (8932204731744).
Almost surely, 2123313110001123 is an apocalyptic number.
123313110001123 is a deficient number, since it is larger than the sum of its proper divisors (19602165706781).
123313110001123 is a wasteful number, since it uses less digits than its factorization.
123313110001123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1888722.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 123313110001123 its reverse (321100011313321), we get a palindrome (444413121314444).
The spelling of 123313110001123 in words is "one hundred twenty-three trillion, three hundred thirteen billion, one hundred ten million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •