Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0011011111101101101 |
3 | 101201010020122102221202 |
4 | 1220110120123331231 |
5 | 3313344320200023 |
6 | 123242430335245 |
7 | 11043511432541 |
oct | 1502430337555 |
9 | 351106572852 |
10 | 112011100013 |
11 | 4355a38933a |
12 | 1986035a525 |
13 | a74105c707 |
14 | 55c832ba21 |
15 | 2da894e128 |
hex | 1a1461bf6d |
112011100013 has 2 divisors, whose sum is σ = 112011100014. Its totient is φ = 112011100012.
The previous prime is 112011099997. The next prime is 112011100043. The reversal of 112011100013 is 310001110211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105805126729 + 6205973284 = 325277^2 + 78778^2 .
It is a cyclic number.
It is not a de Polignac number, because 112011100013 - 24 = 112011099997 is a prime.
It is a super-2 number, since 2×1120111000132 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112011099967 and 112011100003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112011100043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005550006 + 56005550007.
It is an arithmetic number, because the mean of its divisors is an integer number (56005550007).
Almost surely, 2112011100013 is an apocalyptic number.
It is an amenable number.
112011100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
112011100013 is an equidigital number, since it uses as much as digits as its factorization.
112011100013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 112011100013 its reverse (310001110211), we get a palindrome (422012210224).
The spelling of 112011100013 in words is "one hundred twelve billion, eleven million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •