Base | Representation |
---|---|
bin | 10000001101101110101… |
… | …010000100010001111101 |
3 | 10221112002012200210000201 |
4 | 100031232222010101331 |
5 | 121223442240113010 |
6 | 2211514125523501 |
7 | 143334141443053 |
oct | 20155652042175 |
9 | 3845065623021 |
10 | 1114253051005 |
11 | 39a608887196 |
12 | 15bb49113591 |
13 | 810c5957473 |
14 | 3bd044121d3 |
15 | 1deb6e1c23a |
hex | 1036ea8447d |
1114253051005 has 8 divisors (see below), whose sum is σ = 1338617940192. Its totient is φ = 890392921488.
The previous prime is 1114253050931. The next prime is 1114253051053. The reversal of 1114253051005 is 5001503524111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1114253051005 - 215 = 1114253018237 is a prime.
It is a super-2 number, since 2×11142530510052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 126185059 + ... + 126193888.
It is an arithmetic number, because the mean of its divisors is an integer number (167327242524).
Almost surely, 21114253051005 is an apocalyptic number.
It is an amenable number.
1114253051005 is a deficient number, since it is larger than the sum of its proper divisors (224364889187).
1114253051005 is an equidigital number, since it uses as much as digits as its factorization.
1114253051005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252379835.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 1114253051005 its reverse (5001503524111), we get a palindrome (6115756575116).
The spelling of 1114253051005 in words is "one trillion, one hundred fourteen billion, two hundred fifty-three million, fifty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •