Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0010000001001001111 |
3 | 100122222202022211020221 |
4 | 1132022310100021033 |
5 | 3124034434414411 |
6 | 114241210452211 |
7 | 10206452013100 |
oct | 1361264201117 |
9 | 318882284227 |
10 | 101113201231 |
11 | 39977847719 |
12 | 1771a734067 |
13 | 96c53330b3 |
14 | 4c72c383a7 |
15 | 296bd2c071 |
hex | 178ad1024f |
101113201231 has 6 divisors (see below), whose sum is σ = 117621479040. Its totient is φ = 86668458156.
The previous prime is 101113201193. The next prime is 101113201237. The reversal of 101113201231 is 132102311101.
It is a happy number.
It is not a de Polignac number, because 101113201231 - 29 = 101113200719 is a prime.
It is a super-2 number, since 2×1011132012312 (a number of 23 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 (101113201237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1031767311 + ... + 1031767408.
It is an arithmetic number, because the mean of its divisors is an integer number (19603579840).
Almost surely, 2101113201231 is an apocalyptic number.
101113201231 is a deficient number, since it is larger than the sum of its proper divisors (16508277809).
101113201231 is an equidigital number, since it uses as much as digits as its factorization.
101113201231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2063534733 (or 2063534726 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 101113201231 its reverse (132102311101), we get a palindrome (233215512332).
The spelling of 101113201231 in words is "one hundred one billion, one hundred thirteen million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •