Base | Representation |
---|---|
bin | 10000011101100111010… |
… | …101100111110001000001 |
3 | 11000011002221120122212212 |
4 | 100131213111213301001 |
5 | 122013410342320001 |
6 | 2223414450031505 |
7 | 144506630233145 |
oct | 20354725476101 |
9 | 4004087518785 |
10 | 1131310120001 |
11 | 3a6871084626 |
12 | 163309578595 |
13 | 828b370c6b9 |
14 | 3ca81909225 |
15 | 1e6646187bb |
hex | 10767567c41 |
1131310120001 has 8 divisors (see below), whose sum is σ = 1154130762600. Its totient is φ = 1108627367040.
The previous prime is 1131310119913. The next prime is 1131310120013. The reversal of 1131310120001 is 1000210131311.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 25416011776 + 1105894108225 = 159424^2 + 1051615^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 1131310120001 - 218 = 1131309857857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1131310120021) 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, 34455836 + ... + 34488653.
It is an arithmetic number, because the mean of its divisors is an integer number (144266345325).
Almost surely, 21131310120001 is an apocalyptic number.
It is an amenable number.
1131310120001 is a deficient number, since it is larger than the sum of its proper divisors (22820642599).
1131310120001 is an equidigital number, since it uses as much as digits as its factorization.
1131310120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68944819.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1131310120001 its reverse (1000210131311), we get a palindrome (2131520251312).
The spelling of 1131310120001 in words is "one trillion, one hundred thirty-one billion, three hundred ten million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •