Base | Representation |
---|---|
bin | 100011000100100110010… |
… | …110101000101101110001 |
3 | 22112101221102012122101122 |
4 | 203010212112220231301 |
5 | 303441411222334301 |
6 | 5043105514312025 |
7 | 336061011005432 |
oct | 43044626505561 |
9 | 8471842178348 |
10 | 2410120121201 |
11 | 84a142a82011 |
12 | 32b120428615 |
13 | 146372729cc0 |
14 | 84916b23489 |
15 | 42a5d0b081b |
hex | 231265a8b71 |
2410120121201 has 16 divisors (see below), whose sum is σ = 2629065600000. Its totient is φ = 2196149179008.
The previous prime is 2410120121179. The next prime is 2410120121207. The reversal of 2410120121201 is 1021210210142.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2410120121201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2410120121201.
It is not an unprimeable number, because it can be changed into a prime (2410120121207) 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 15 ways as a sum of consecutive naturals, for example, 3461201 + ... + 4098798.
It is an arithmetic number, because the mean of its divisors is an integer number (164316600000).
Almost surely, 22410120121201 is an apocalyptic number.
It is an amenable number.
2410120121201 is a deficient number, since it is larger than the sum of its proper divisors (218945478799).
2410120121201 is a wasteful number, since it uses less digits than its factorization.
2410120121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7560328.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 2410120121201 its reverse (1021210210142), we get a palindrome (3431330331343).
The spelling of 2410120121201 in words is "two trillion, four hundred ten billion, one hundred twenty million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •