Base | Representation |
---|---|
bin | 1001010011101010011000… |
… | …1111001111001001010010 |
3 | 1100020022012022121012001111 |
4 | 2110322212033033021102 |
5 | 2320131001141023442 |
6 | 33433054244523534 |
7 | 2104224135143110 |
oct | 224724617171122 |
9 | 40208168535044 |
10 | 10233401111122 |
11 | 3295a63163392 |
12 | 11933753b05aa |
13 | 59300c364277 |
14 | 275429234ab0 |
15 | 12b2da8b7b17 |
hex | 94ea63cf252 |
10233401111122 has 16 divisors (see below), whose sum is σ = 18108875699712. Its totient is φ = 4244267741760.
The previous prime is 10233401111071. The next prime is 10233401111123. The reversal of 10233401111122 is 22111110433201.
10233401111122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102334011111222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10233401111093 and 10233401111102.
It is not an unprimeable number, because it can be changed into a prime (10233401111123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11789632183 + ... + 11789633050.
It is an arithmetic number, because the mean of its divisors is an integer number (1131804731232).
Almost surely, 210233401111122 is an apocalyptic number.
10233401111122 is a deficient number, since it is larger than the sum of its proper divisors (7875474588590).
10233401111122 is a wasteful number, since it uses less digits than its factorization.
10233401111122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23579265273.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 10233401111122 its reverse (22111110433201), we get a palindrome (32344511544323).
The spelling of 10233401111122 in words is "ten trillion, two hundred thirty-three billion, four hundred one million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •