Base | Representation |
---|---|
bin | 110100001110000010… |
… | …1011100110011010010 |
3 | 101201110020211112111000 |
4 | 1220130011130303102 |
5 | 3314130411343214 |
6 | 123303324402430 |
7 | 11046641111013 |
oct | 1503405346322 |
9 | 351406745430 |
10 | 112140340434 |
11 | 43616331601 |
12 | 198976a6416 |
13 | a761a70535 |
14 | 55db57100a |
15 | 2db4e7c809 |
hex | 1a1c15ccd2 |
112140340434 has 32 divisors (see below), whose sum is σ = 249277659840. Its totient is φ = 37368578016.
The previous prime is 112140340349. The next prime is 112140340451. The reversal of 112140340434 is 434043041211.
112140340434 is a `hidden beast` number, since 11 + 214 + 0 + 3 + 4 + 0 + 434 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 112140340398 and 112140340407.
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 15 ways as a sum of consecutive naturals, for example, 142924 + ... + 494679.
It is an arithmetic number, because the mean of its divisors is an integer number (7789926870).
Almost surely, 2112140340434 is an apocalyptic number.
112140340434 is an abundant number, since it is smaller than the sum of its proper divisors (137137319406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112140340434 is a wasteful number, since it uses less digits than its factorization.
112140340434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640871 (or 640865 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 112140340434 its reverse (434043041211), we get a palindrome (546183381645).
The spelling of 112140340434 in words is "one hundred twelve billion, one hundred forty million, three hundred forty thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •