Base | Representation |
---|---|
bin | 10000000101001101111… |
… | …100111111111010101001 |
3 | 10220122111022202210022111 |
4 | 100011031330333322221 |
5 | 121101233243244040 |
6 | 2203403233322321 |
7 | 142561523450344 |
oct | 20051574777251 |
9 | 3818438683274 |
10 | 1105114431145 |
11 | 39674931689a |
12 | 15a2187063a1 |
13 | 8029a5610aa |
14 | 3b6b883545b |
15 | 1db2e9acdea |
hex | 1014df3fea9 |
1105114431145 has 8 divisors (see below), whose sum is σ = 1326148677504. Its totient is φ = 884083971504.
The previous prime is 1105114431139. The next prime is 1105114431181. The reversal of 1105114431145 is 5411344115011.
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 1105114431145 - 221 = 1105112333993 is a prime.
It is a super-2 number, since 2×11051144311452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 259249 + ... + 1509118.
It is an arithmetic number, because the mean of its divisors is an integer number (165768584688).
Almost surely, 21105114431145 is an apocalyptic number.
It is an amenable number.
1105114431145 is a deficient number, since it is larger than the sum of its proper divisors (221034246359).
1105114431145 is a wasteful number, since it uses less digits than its factorization.
1105114431145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1893359.
The product of its (nonzero) digits is 4800, while the sum is 31.
Adding to 1105114431145 its reverse (5411344115011), we get a palindrome (6516458546156).
The spelling of 1105114431145 in words is "one trillion, one hundred five billion, one hundred fourteen million, four hundred thirty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •