Base | Representation |
---|---|
bin | 10000110011111000100… |
… | …100101100101010010110 |
3 | 11002102211101020221211220 |
4 | 100303320210230222112 |
5 | 122411343212330024 |
6 | 2242411304111210 |
7 | 146314316424351 |
oct | 20637044545226 |
9 | 4072741227756 |
10 | 1155221605014 |
11 | 405a21530194 |
12 | 167a81465506 |
13 | 84c245869b9 |
14 | 3dcad4a3298 |
15 | 200b3972e79 |
hex | 10cf892ca96 |
1155221605014 has 64 divisors (see below), whose sum is σ = 2465447362560. Its totient is φ = 359824788000.
The previous prime is 1155221605009. The next prime is 1155221605019. The reversal of 1155221605014 is 4105061225511.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1155221605009) and next prime (1155221605019).
It is a super-2 number, since 2×11552216050142 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1155221605019) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2751259 + ... + 3143225.
It is an arithmetic number, because the mean of its divisors is an integer number (38522615040).
Almost surely, 21155221605014 is an apocalyptic number.
1155221605014 is an abundant number, since it is smaller than the sum of its proper divisors (1310225757546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1155221605014 is a wasteful number, since it uses less digits than its factorization.
1155221605014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392345.
The product of its (nonzero) digits is 12000, while the sum is 33.
The spelling of 1155221605014 in words is "one trillion, one hundred fifty-five billion, two hundred twenty-one million, six hundred five thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •