Base | Representation |
---|---|
bin | 10001100111000010000… |
… | …101111011011000000001 |
3 | 11021200120212221102000110 |
4 | 101213002011323120001 |
5 | 124311332342102001 |
6 | 2323533121541533 |
7 | 153300310335000 |
oct | 21470205733001 |
9 | 4250525842013 |
10 | 1210142144001 |
11 | 427244767a8a |
12 | 17664a1a48a9 |
13 | 8a16788334b |
14 | 427dd4ccc37 |
15 | 2172a2c53d6 |
hex | 119c217b601 |
1210142144001 has 16 divisors (see below), whose sum is σ = 1881659312000. Its totient is φ = 691509795984.
The previous prime is 1210142143999. The next prime is 1210142144027. The reversal of 1210142144001 is 1004412410121.
It is not a de Polignac number, because 1210142144001 - 21 = 1210142143999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1210142144201) 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 15 ways as a sum of consecutive naturals, for example, 588017506 + ... + 588019563.
It is an arithmetic number, because the mean of its divisors is an integer number (117603707000).
Almost surely, 21210142144001 is an apocalyptic number.
It is an amenable number.
1210142144001 is a deficient number, since it is larger than the sum of its proper divisors (671517167999).
1210142144001 is an equidigital number, since it uses as much as digits as its factorization.
1210142144001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1176037093 (or 1176037079 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 1210142144001 its reverse (1004412410121), we get a palindrome (2214554554122).
The spelling of 1210142144001 in words is "one trillion, two hundred ten billion, one hundred forty-two million, one hundred forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •