Base | Representation |
---|---|
bin | 11001110100011010111001… |
… | …001100011111010010101111 |
3 | 112220001121022100012120202021 |
4 | 121310122321030133102233 |
5 | 104340424432310234021 |
6 | 1041301422541411011 |
7 | 32626652260023202 |
oct | 3164327114372257 |
9 | 486047270176667 |
10 | 113553452430511 |
11 | 331aa826623575 |
12 | 1089b505569a67 |
13 | 4b49077041422 |
14 | 20080330c5939 |
15 | d1dbbc591c41 |
hex | 6746b931f4af |
113553452430511 has 4 divisors (see below), whose sum is σ = 115695970400952. Its totient is φ = 111410934460072.
The previous prime is 113553452430497. The next prime is 113553452430553. The reversal of 113553452430511 is 115034254355311.
It is a happy number.
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 113553452430511 - 29 = 113553452429999 is a prime.
It is a super-2 number, since 2×1135534524305112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113553452430611) 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, 1071258985141 + ... + 1071258985246.
It is an arithmetic number, because the mean of its divisors is an integer number (28923992600238).
Almost surely, 2113553452430511 is an apocalyptic number.
113553452430511 is a deficient number, since it is larger than the sum of its proper divisors (2142517970441).
113553452430511 is an equidigital number, since it uses as much as digits as its factorization.
113553452430511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2142517970440.
The product of its (nonzero) digits is 540000, while the sum is 43.
The spelling of 113553452430511 in words is "one hundred thirteen trillion, five hundred fifty-three billion, four hundred fifty-two million, four hundred thirty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •