Base | Representation |
---|---|
bin | 110011111000101001… |
… | …0110110011011110101 |
3 | 101122121012222001122021 |
4 | 1213301102312123311 |
5 | 3311143120324023 |
6 | 123104201233141 |
7 | 11023103024323 |
oct | 1476122663365 |
9 | 348535861567 |
10 | 111422433013 |
11 | 43288071091 |
12 | 197171927b1 |
13 | a679101348 |
14 | 5570094d13 |
15 | 2d71e1e35d |
hex | 19f14b66f5 |
111422433013 has 4 divisors (see below), whose sum is σ = 111424075648. Its totient is φ = 111420790380.
The previous prime is 111422432951. The next prime is 111422433019. The reversal of 111422433013 is 310334224111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310334224111 = 577 ⋅537840943.
It is a cyclic number.
It is not a de Polignac number, because 111422433013 - 213 = 111422424821 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 (111422433019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 714981 + ... + 856762.
It is an arithmetic number, because the mean of its divisors is an integer number (27856018912).
Almost surely, 2111422433013 is an apocalyptic number.
It is an amenable number.
111422433013 is a deficient number, since it is larger than the sum of its proper divisors (1642635).
111422433013 is an equidigital number, since it uses as much as digits as its factorization.
111422433013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1642634.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 111422433013 its reverse (310334224111), we get a palindrome (421756657124).
The spelling of 111422433013 in words is "one hundred eleven billion, four hundred twenty-two million, four hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •