Base | Representation |
---|---|
bin | 10000100000001110111… |
… | …000111010001011000001 |
3 | 11000102100212001120101022 |
4 | 100200032320322023001 |
5 | 122040140004244010 |
6 | 2225001424315225 |
7 | 144636402564116 |
oct | 20401670721301 |
9 | 4012325046338 |
10 | 1134121165505 |
11 | 3a7a83916729 |
12 | 163972a72b15 |
13 | 82c40c06333 |
14 | 3cc6ada690d |
15 | 1e77b2d5d55 |
hex | 1080ee3a2c1 |
1134121165505 has 4 divisors (see below), whose sum is σ = 1360945398612. Its totient is φ = 907296932400.
The previous prime is 1134121165501. The next prime is 1134121165519. The reversal of 1134121165505 is 5055611214311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 321525289024 + 812595876481 = 567032^2 + 901441^2 .
It is not a de Polignac number, because 1134121165505 - 22 = 1134121165501 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1134121165501) 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, 113412116546 + ... + 113412116555.
It is an arithmetic number, because the mean of its divisors is an integer number (340236349653).
Almost surely, 21134121165505 is an apocalyptic number.
It is an amenable number.
1134121165505 is a deficient number, since it is larger than the sum of its proper divisors (226824233107).
1134121165505 is an equidigital number, since it uses as much as digits as its factorization.
1134121165505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226824233106.
The product of its (nonzero) digits is 18000, while the sum is 35.
Adding to 1134121165505 its reverse (5055611214311), we get a palindrome (6189732379816).
The spelling of 1134121165505 in words is "one trillion, one hundred thirty-four billion, one hundred twenty-one million, one hundred sixty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •