Base | Representation |
---|---|
bin | 110100001011010110… |
… | …1110010100100000011 |
3 | 101201012222022120102122 |
4 | 1220112231302210003 |
5 | 3313434331031120 |
6 | 123250345434455 |
7 | 11044465266431 |
oct | 1502655624403 |
9 | 351188276378 |
10 | 112050252035 |
11 | 4357a49a887 |
12 | 1987149ba2b |
13 | a7491ba2a7 |
14 | 55cd5ddd51 |
15 | 2dac0d4a25 |
hex | 1a16b72903 |
112050252035 has 4 divisors (see below), whose sum is σ = 134460302448. Its totient is φ = 89640201624.
The previous prime is 112050251927. The next prime is 112050252079. The reversal of 112050252035 is 530252050211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 530252050211 = 13 ⋅40788619247.
It is a cyclic number.
It is not a de Polignac number, because 112050252035 - 220 = 112049203459 is a prime.
It is a super-2 number, since 2×1120502520352 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112050251995 and 112050252013.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 11205025199 + ... + 11205025208.
It is an arithmetic number, because the mean of its divisors is an integer number (33615075612).
Almost surely, 2112050252035 is an apocalyptic number.
112050252035 is a deficient number, since it is larger than the sum of its proper divisors (22410050413).
112050252035 is an equidigital number, since it uses as much as digits as its factorization.
112050252035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22410050412.
The product of its (nonzero) digits is 3000, while the sum is 26.
The spelling of 112050252035 in words is "one hundred twelve billion, fifty million, two hundred fifty-two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •