Base | Representation |
---|---|
bin | 11001000000111000110010… |
… | …000111010111010101010011 |
3 | 112102112001112201010200121010 |
4 | 121000320302013113111103 |
5 | 103404414322034023443 |
6 | 1025550513134302003 |
7 | 32113054133332425 |
oct | 3100706207272523 |
9 | 472461481120533 |
10 | 110012133111123 |
11 | 3206497a149161 |
12 | 10409108957903 |
13 | 495013aba0859 |
14 | 1d248894cc815 |
15 | caba049c8733 |
hex | 640e321d7553 |
110012133111123 has 16 divisors (see below), whose sum is σ = 148455177010560. Its totient is φ = 72455315996544.
The previous prime is 110012133111109. The next prime is 110012133111149. The reversal of 110012133111123 is 321111331210011.
It is not a de Polignac number, because 110012133111123 - 26 = 110012133111059 is a prime.
It is a super-2 number, since 2×1100121331111232 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110012133111123.
It is not an unprimeable number, because it can be changed into a prime (110012133111103) 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, 224086 + ... + 14834907.
It is an arithmetic number, because the mean of its divisors is an integer number (9278448563160).
Almost surely, 2110012133111123 is an apocalyptic number.
110012133111123 is a deficient number, since it is larger than the sum of its proper divisors (38443043899437).
110012133111123 is a wasteful number, since it uses less digits than its factorization.
110012133111123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15088418.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 110012133111123 its reverse (321111331210011), we get a palindrome (431123464321134).
The spelling of 110012133111123 in words is "one hundred ten trillion, twelve billion, one hundred thirty-three million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •