Base | Representation |
---|---|
bin | 110100101000010100… |
… | …1001101111110000101 |
3 | 101210201201002012020122 |
4 | 1221100221031332011 |
5 | 3322432131211401 |
6 | 123531024311325 |
7 | 11110536162134 |
oct | 1512051157605 |
9 | 353651065218 |
10 | 113022132101 |
11 | 43a2905774a |
12 | 19aa2a72545 |
13 | a872660158 |
14 | 568270b91b |
15 | 2e175ae21b |
hex | 1a50a4df85 |
113022132101 has 2 divisors, whose sum is σ = 113022132102. Its totient is φ = 113022132100.
The previous prime is 113022132017. The next prime is 113022132107. The reversal of 113022132101 is 101231220311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70968427201 + 42053704900 = 266399^2 + 205070^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113022132101 is a prime.
It is a super-3 number, since 3×1130221321013 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113022132101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113022132107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56511066050 + 56511066051.
It is an arithmetic number, because the mean of its divisors is an integer number (56511066051).
Almost surely, 2113022132101 is an apocalyptic number.
It is an amenable number.
113022132101 is a deficient number, since it is larger than the sum of its proper divisors (1).
113022132101 is an equidigital number, since it uses as much as digits as its factorization.
113022132101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 113022132101 its reverse (101231220311), we get a palindrome (214253352412).
The spelling of 113022132101 in words is "one hundred thirteen billion, twenty-two million, one hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •