Base | Representation |
---|---|
bin | 11001001111101101111110… |
… | …011010011000110011001000 |
3 | 112120010111020121212011102111 |
4 | 121033231332122120303020 |
5 | 104023114121011243212 |
6 | 1032051030123312104 |
7 | 32246514424434244 |
oct | 3117557632306310 |
9 | 476114217764374 |
10 | 111031320415432 |
11 | 3241813388083a |
12 | 1055274467b634 |
13 | 49c52933675a1 |
14 | 1d5bd31d09424 |
15 | cc82a5976ea7 |
hex | 64fb7e698cc8 |
111031320415432 has 32 divisors (see below), whose sum is σ = 216012797959680. Its totient is φ = 53446465428480.
The previous prime is 111031320415427. The next prime is 111031320415447. The reversal of 111031320415432 is 234514023130111.
It is a happy number.
It is a super-2 number, since 2×1110313204154322 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 111031320415394 and 111031320415403.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1159814668 + ... + 1159910395.
It is an arithmetic number, because the mean of its divisors is an integer number (6750399936240).
Almost surely, 2111031320415432 is an apocalyptic number.
It is an amenable number.
111031320415432 is a deficient number, since it is larger than the sum of its proper divisors (104981477544248).
111031320415432 is a wasteful number, since it uses less digits than its factorization.
111031320415432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2319725293 (or 2319725289 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 111031320415432 its reverse (234514023130111), we get a palindrome (345545343545543).
The spelling of 111031320415432 in words is "one hundred eleven trillion, thirty-one billion, three hundred twenty million, four hundred fifteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •