Base | Representation |
---|---|
bin | 110100001101110001… |
… | …0110100001001011111 |
3 | 101201102121202020212112 |
4 | 1220123202310021133 |
5 | 3314121100323043 |
6 | 123302402024235 |
7 | 11046500664305 |
oct | 1503342641137 |
9 | 351377666775 |
10 | 112131261023 |
11 | 436111a0061 |
12 | 1989464807b |
13 | a75cc119c2 |
14 | 55da28a275 |
15 | 2db4287518 |
hex | 1a1b8b425f |
112131261023 has 8 divisors (see below), whose sum is σ = 118041529200. Its totient is φ = 106221855168.
The previous prime is 112131261007. The next prime is 112131261031. The reversal of 112131261023 is 320162131211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112131261023 - 24 = 112131261007 is a prime.
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 112131261023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112131261523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60413 + ... + 477401.
It is an arithmetic number, because the mean of its divisors is an integer number (14755191150).
Almost surely, 2112131261023 is an apocalyptic number.
112131261023 is a deficient number, since it is larger than the sum of its proper divisors (5910268177).
112131261023 is a wasteful number, since it uses less digits than its factorization.
112131261023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431161.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 112131261023 its reverse (320162131211), we get a palindrome (432293392234).
The spelling of 112131261023 in words is "one hundred twelve billion, one hundred thirty-one million, two hundred sixty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •