Base | Representation |
---|---|
bin | 10011010111110010010… |
… | …111000000011110100001 |
3 | 11201021002101101010202121 |
4 | 103113302113000132201 |
5 | 133302310004341001 |
6 | 2455314435544241 |
7 | 165114435621433 |
oct | 23276227003641 |
9 | 4637071333677 |
10 | 1331211012001 |
11 | 473621a03492 |
12 | 195bb7a5b081 |
13 | 986c033b090 |
14 | 4860678c653 |
15 | 249640126a1 |
hex | 135f25c07a1 |
1331211012001 has 8 divisors (see below), whose sum is σ = 1433684566440. Its totient is φ = 1228747844352.
The previous prime is 1331211011969. The next prime is 1331211012049. The reversal of 1331211012001 is 1002101121331.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 36904331025 + 1294306680976 = 192105^2 + 1137676^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 1331211012001 - 25 = 1331211011969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1331211012301) 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, 2329486 + ... + 2844103.
It is an arithmetic number, because the mean of its divisors is an integer number (179210570805).
Almost surely, 21331211012001 is an apocalyptic number.
It is an amenable number.
1331211012001 is a deficient number, since it is larger than the sum of its proper divisors (102473554439).
1331211012001 is a wasteful number, since it uses less digits than its factorization.
1331211012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5193395.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1331211012001 its reverse (1002101121331), we get a palindrome (2333312133332).
The spelling of 1331211012001 in words is "one trillion, three hundred thirty-one billion, two hundred eleven million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •