Base | Representation |
---|---|
bin | 10001100111000001011… |
… | …011111000001111100001 |
3 | 11021200120010012101110122 |
4 | 101213001123320033201 |
5 | 124311322031333441 |
6 | 2323532045410025 |
7 | 153300114545216 |
oct | 21470133701741 |
9 | 4250503171418 |
10 | 1210131121121 |
11 | 42723951936a |
12 | 176646569915 |
13 | 8a1654c4030 |
14 | 427dbc5db0d |
15 | 2172934934b |
hex | 119c16f83e1 |
1210131121121 has 32 divisors (see below), whose sum is σ = 1363782420000. Its totient is φ = 1066033317888.
The previous prime is 1210131121117. The next prime is 1210131121153. The reversal of 1210131121121 is 1211211310121.
It can be written as a sum of positive squares in 16 ways, for example, as 1058429440000 + 151701681121 = 1028800^2 + 389489^2 .
It is a cyclic number.
It is not a de Polignac number, because 1210131121121 - 22 = 1210131121117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1210131121121.
It is not an unprimeable number, because it can be changed into a prime (1210131121321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 145917851 + ... + 145926143.
It is an arithmetic number, because the mean of its divisors is an integer number (42618200625).
Almost surely, 21210131121121 is an apocalyptic number.
It is an amenable number.
1210131121121 is a deficient number, since it is larger than the sum of its proper divisors (153651298879).
1210131121121 is a wasteful number, since it uses less digits than its factorization.
1210131121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12773.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1210131121121 its reverse (1211211310121), we get a palindrome (2421342431242).
The spelling of 1210131121121 in words is "one trillion, two hundred ten billion, one hundred thirty-one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.035 sec. • engine limits •