Base | Representation |
---|---|
bin | 10111000010010000010011… |
… | …110111111100110011001111 |
3 | 111021201010212121211221120121 |
4 | 113002100103313330303033 |
5 | 101234330411113341421 |
6 | 555245103120525411 |
7 | 30224256534415063 |
oct | 2702202367746317 |
9 | 437633777757517 |
10 | 101310022012111 |
11 | 2a30a380308400 |
12 | b442689480867 |
13 | 446b656666a63 |
14 | 1b0360740daa3 |
15 | baa48d49ed41 |
hex | 5c2413dfcccf |
101310022012111 has 24 divisors (see below), whose sum is σ = 111462226848000. Its totient is φ = 92013269982480.
The previous prime is 101310022012103. The next prime is 101310022012123. The reversal of 101310022012111 is 111210220013101.
It is a happy number.
It is not a de Polignac number, because 101310022012111 - 23 = 101310022012103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101310022112111) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 675924600 + ... + 676074466.
It is an arithmetic number, because the mean of its divisors is an integer number (4644259452000).
Almost surely, 2101310022012111 is an apocalyptic number.
101310022012111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101310022012111 is a deficient number, since it is larger than the sum of its proper divisors (10152204835889).
101310022012111 is a wasteful number, since it uses less digits than its factorization.
101310022012111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155115 (or 155104 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 101310022012111 its reverse (111210220013101), we get a palindrome (212520242025212).
The spelling of 101310022012111 in words is "one hundred one trillion, three hundred ten billion, twenty-two million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •