Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …111000011111111111111 |
3 | 10220021010121211112122221 |
4 | 100001132233003333333 |
5 | 121020023330220411 |
6 | 2201501104150211 |
7 | 142360211161546 |
oct | 20013657037777 |
9 | 3807117745587 |
10 | 1101101023231 |
11 | 394a79905050 |
12 | 159498608367 |
13 | 7caaac26901 |
14 | 3b4177d115d |
15 | 1d99748a071 |
hex | 1005ebc3fff |
1101101023231 has 16 divisors (see below), whose sum is σ = 1202907813120. Its totient is φ = 999579683520.
The previous prime is 1101101023207. The next prime is 1101101023237. The reversal of 1101101023231 is 1323201011011.
It is a happy number.
It is not a de Polignac number, because 1101101023231 - 25 = 1101101023199 is a prime.
It is a super-2 number, since 2×11011010232312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101101023237) 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, 23374780 + ... + 23421838.
It is an arithmetic number, because the mean of its divisors is an integer number (75181738320).
Almost surely, 21101101023231 is an apocalyptic number.
1101101023231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1101101023231 is a deficient number, since it is larger than the sum of its proper divisors (101806789889).
1101101023231 is a wasteful number, since it uses less digits than its factorization.
1101101023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50046.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1101101023231 its reverse (1323201011011), we get a palindrome (2424302034242).
The spelling of 1101101023231 in words is "one trillion, one hundred one billion, one hundred one million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •