Base | Representation |
---|---|
bin | 10001101000010000010… |
… | …110100001001101111001 |
3 | 11021210222101112022012200 |
4 | 101220100112201031321 |
5 | 124322030002204103 |
6 | 2324311303300413 |
7 | 153344662404102 |
oct | 21502026411571 |
9 | 4253871468180 |
10 | 1211455116153 |
11 | 427858915437 |
12 | 176955a4a709 |
13 | 8a3168b0949 |
14 | 428c5a293a9 |
15 | 217a56c90a3 |
hex | 11a105a1379 |
1211455116153 has 24 divisors (see below), whose sum is σ = 1876732865280. Its totient is φ = 750693134880.
The previous prime is 1211455116149. The next prime is 1211455116161. The reversal of 1211455116153 is 3516115541121.
1211455116153 is a `hidden beast` number, since 1 + 21 + 1 + 4 + 5 + 5 + 11 + 615 + 3 = 666.
It is not a de Polignac number, because 1211455116153 - 22 = 1211455116149 is a prime.
It is a super-3 number, since 3×12114551161533 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1211455116653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 66826153 + ... + 66844278.
It is an arithmetic number, because the mean of its divisors is an integer number (78197202720).
Almost surely, 21211455116153 is an apocalyptic number.
It is an amenable number.
1211455116153 is a deficient number, since it is larger than the sum of its proper divisors (665277749127).
1211455116153 is a wasteful number, since it uses less digits than its factorization.
1211455116153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133670509 (or 133670506 counting only the distinct ones).
The product of its digits is 18000, while the sum is 36.
The spelling of 1211455116153 in words is "one trillion, two hundred eleven billion, four hundred fifty-five million, one hundred sixteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •