Base | Representation |
---|---|
bin | 110011101101000101… |
… | …1001100111101011001 |
3 | 101121121012002200010111 |
4 | 1213122023030331121 |
5 | 3304344321132103 |
6 | 123001503444321 |
7 | 11010353056330 |
oct | 1473213147531 |
9 | 347535080114 |
10 | 111034552153 |
11 | 430a9123498 |
12 | 196292b66a1 |
13 | a616944045 |
14 | 5534766d17 |
15 | 2d4cd5186d |
hex | 19da2ccf59 |
111034552153 has 4 divisors (see below), whose sum is σ = 126896631040. Its totient is φ = 95172473268.
The previous prime is 111034552133. The next prime is 111034552177. The reversal of 111034552153 is 351255430111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 351255430111 = 37 ⋅9493390003.
It is a cyclic number.
It is not a de Polignac number, because 111034552153 - 225 = 111000997721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111034552103) 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, 7931039433 + ... + 7931039446.
It is an arithmetic number, because the mean of its divisors is an integer number (31724157760).
Almost surely, 2111034552153 is an apocalyptic number.
It is an amenable number.
111034552153 is a deficient number, since it is larger than the sum of its proper divisors (15862078887).
111034552153 is an equidigital number, since it uses as much as digits as its factorization.
111034552153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15862078886.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 111034552153 its reverse (351255430111), we get a palindrome (462289982264).
The spelling of 111034552153 in words is "one hundred eleven billion, thirty-four million, five hundred fifty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •