Base | Representation |
---|---|
bin | 10001101001001011001… |
… | …000111011101001000001 |
3 | 11021220112010102020011121 |
4 | 101221023020323221001 |
5 | 124331040000110423 |
6 | 2324553215112241 |
7 | 153411266641513 |
oct | 21511310735101 |
9 | 4256463366147 |
10 | 1212441410113 |
11 | 42821462770a |
12 | 176b90212681 |
13 | 8a44302c43b |
14 | 4297aa09bb3 |
15 | 2181209e45d |
hex | 11a4b23ba41 |
1212441410113 has 8 divisors (see below), whose sum is σ = 1246249684008. Its totient is φ = 1179038025984.
The previous prime is 1212441410057. The next prime is 1212441410129. The reversal of 1212441410113 is 3110141442121.
It can be written as a sum of positive squares in 4 ways, for example, as 20901063184 + 1191540346929 = 144572^2 + 1091577^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 1212441410113 - 213 = 1212441401921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1212441410513) 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, 101216370 + ... + 101228347.
It is an arithmetic number, because the mean of its divisors is an integer number (155781210501).
Almost surely, 21212441410113 is an apocalyptic number.
It is an amenable number.
1212441410113 is a deficient number, since it is larger than the sum of its proper divisors (33808273895).
1212441410113 is a wasteful number, since it uses less digits than its factorization.
1212441410113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202444883.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 1212441410113 its reverse (3110141442121), we get a palindrome (4322582852234).
The spelling of 1212441410113 in words is "one trillion, two hundred twelve billion, four hundred forty-one million, four hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •