Base | Representation |
---|---|
bin | 10100100001100011001… |
… | …110110110010110010101 |
3 | 11222211112011222101212101 |
4 | 110201203032312112111 |
5 | 141102012003010401 |
6 | 2555534005122101 |
7 | 203620243062043 |
oct | 24414316662625 |
9 | 4884464871771 |
10 | 1410414110101 |
11 | 4a4175aa5357 |
12 | 1a94209b9331 |
13 | a30033361b9 |
14 | 4c39b767393 |
15 | 26a4c56c101 |
hex | 148633b6595 |
1410414110101 has 8 divisors (see below), whose sum is σ = 1448548748504. Its totient is φ = 1372280279040.
The previous prime is 1410414110093. The next prime is 1410414110117. The reversal of 1410414110101 is 1010114140141.
It can be written as a sum of positive squares in 4 ways, for example, as 299645665201 + 1110768444900 = 547399^2 + 1053930^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1410414110101 - 23 = 1410414110093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1410414110701) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5450221 + ... + 5703133.
It is an arithmetic number, because the mean of its divisors is an integer number (181068593563).
Almost surely, 21410414110101 is an apocalyptic number.
It is an amenable number.
1410414110101 is a deficient number, since it is larger than the sum of its proper divisors (38134638403).
1410414110101 is a wasteful number, since it uses less digits than its factorization.
1410414110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 403671.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 1410414110101 its reverse (1010114140141), we get a palindrome (2420528250242).
The spelling of 1410414110101 in words is "one trillion, four hundred ten billion, four hundred fourteen million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •