Base | Representation |
---|---|
bin | 110100001010100001… |
… | …1101111111101110011 |
3 | 101201011001000021212122 |
4 | 1220111003233331303 |
5 | 3313410222013011 |
6 | 123243513544455 |
7 | 11044010102120 |
oct | 1502503577563 |
9 | 351131007778 |
10 | 112022454131 |
11 | 43565833905 |
12 | 1986411512b |
13 | a743506723 |
14 | 55c9a45747 |
15 | 2da99433db |
hex | 1a150eff73 |
112022454131 has 4 divisors (see below), whose sum is σ = 128025661872. Its totient is φ = 96019246392.
The previous prime is 112022454127. The next prime is 112022454157. The reversal of 112022454131 is 131454220211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112022454131 - 22 = 112022454127 is a prime.
It is a super-2 number, since 2×1120224541312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112022454131.
It is not an unprimeable number, because it can be changed into a prime (112022454161) 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, 8001603860 + ... + 8001603873.
It is an arithmetic number, because the mean of its divisors is an integer number (32006415468).
Almost surely, 2112022454131 is an apocalyptic number.
112022454131 is a deficient number, since it is larger than the sum of its proper divisors (16003207741).
112022454131 is an equidigital number, since it uses as much as digits as its factorization.
112022454131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16003207740.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 112022454131 its reverse (131454220211), we get a palindrome (243476674342).
The spelling of 112022454131 in words is "one hundred twelve billion, twenty-two million, four hundred fifty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •