Base | Representation |
---|---|
bin | 10001101000001010000… |
… | …110000111011110100001 |
3 | 11021210201002000121222222 |
4 | 101220022012013132201 |
5 | 124321321114344441 |
6 | 2324253033440425 |
7 | 153342246261323 |
oct | 21501206073641 |
9 | 4253632017888 |
10 | 1211350153121 |
11 | 427804644129 |
12 | 176926870115 |
13 | 8a2cac20144 |
14 | 428b5b05613 |
15 | 2179b393d4b |
hex | 11a0a1877a1 |
1211350153121 has 8 divisors (see below), whose sum is σ = 1250440018944. Its totient is φ = 1172261165760.
The previous prime is 1211350153087. The next prime is 1211350153127. The reversal of 1211350153121 is 1213510531121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1211350153121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1211350153127) 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 7 ways as a sum of consecutive naturals, for example, 3684920 + ... + 4000166.
It is an arithmetic number, because the mean of its divisors is an integer number (156305002368).
Almost surely, 21211350153121 is an apocalyptic number.
It is an amenable number.
1211350153121 is a deficient number, since it is larger than the sum of its proper divisors (39089865823).
1211350153121 is a wasteful number, since it uses less digits than its factorization.
1211350153121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439231.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 1211350153121 its reverse (1213510531121), we get a palindrome (2424860684242).
The spelling of 1211350153121 in words is "one trillion, two hundred eleven billion, three hundred fifty million, one hundred fifty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •