Base | Representation |
---|---|
bin | 11001011110010010010011… |
… | …101001010111101001110011 |
3 | 112200200012012212022122101212 |
4 | 121132102103221113221303 |
5 | 104141014330413410103 |
6 | 1034134550443550335 |
7 | 32412034261043363 |
oct | 3136222351275163 |
9 | 480605185278355 |
10 | 112032404044403 |
11 | 3277374844a167 |
12 | 1069476952b3ab |
13 | 4a687c1ca13ab |
14 | 1d9457c22c9a3 |
15 | ce43473dd7d8 |
hex | 65e493a57a73 |
112032404044403 has 4 divisors (see below), whose sum is σ = 112032429537168. Its totient is φ = 112032378551640.
The previous prime is 112032404044399. The next prime is 112032404044427. The reversal of 112032404044403 is 304440404230211.
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 112032404044403 - 22 = 112032404044399 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 112032404044403.
It is not an unprimeable number, because it can be changed into a prime (112032404049403) 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, 4279751 + ... + 15568592.
It is an arithmetic number, because the mean of its divisors is an integer number (28008107384292).
Almost surely, 2112032404044403 is an apocalyptic number.
112032404044403 is a deficient number, since it is larger than the sum of its proper divisors (25492765).
112032404044403 is an equidigital number, since it uses as much as digits as its factorization.
112032404044403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25492764.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 112032404044403 its reverse (304440404230211), we get a palindrome (416472808274614).
The spelling of 112032404044403 in words is "one hundred twelve trillion, thirty-two billion, four hundred four million, forty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •