Base | Representation |
---|---|
bin | 10011010111100111000… |
… | …101111111001101110101 |
3 | 11201020121012201101102122 |
4 | 103113213011333031311 |
5 | 133301413113013023 |
6 | 2455244004445325 |
7 | 165106652223125 |
oct | 23274705771565 |
9 | 4636535641378 |
10 | 1331022001013 |
11 | 473535246761 |
12 | 195b646a9845 |
13 | 98690130863 |
14 | 485c962ac85 |
15 | 249526292c8 |
hex | 135e717f375 |
1331022001013 has 4 divisors (see below), whose sum is σ = 1401075790560. Its totient is φ = 1260968211468.
The previous prime is 1331022001007. The next prime is 1331022001027. The reversal of 1331022001013 is 3101002201331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1331022001013 - 218 = 1331021738869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1331022000982 and 1331022001000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331022001063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35026894745 + ... + 35026894782.
It is an arithmetic number, because the mean of its divisors is an integer number (350268947640).
Almost surely, 21331022001013 is an apocalyptic number.
It is an amenable number.
1331022001013 is a deficient number, since it is larger than the sum of its proper divisors (70053789547).
1331022001013 is an equidigital number, since it uses as much as digits as its factorization.
1331022001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70053789546.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1331022001013 its reverse (3101002201331), we get a palindrome (4432024202344).
The spelling of 1331022001013 in words is "one trillion, three hundred thirty-one billion, twenty-two million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •