Base | Representation |
---|---|
bin | 10010111011101001101… |
… | …101011101000000110001 |
3 | 11121101010000011010110021 |
4 | 102323221231131000301 |
5 | 132303422242130113 |
6 | 2433401025203441 |
7 | 162665010100003 |
oct | 22735155350061 |
9 | 4541100133407 |
10 | 1301001130033 |
11 | 46182a247a90 |
12 | 190186790581 |
13 | 958b763ba87 |
14 | 46d7c50c373 |
15 | 23c96c7b48d |
hex | 12ee9b5d031 |
1301001130033 has 4 divisors (see below), whose sum is σ = 1419273960048. Its totient is φ = 1182728300020.
The previous prime is 1301001130027. The next prime is 1301001130043. The reversal of 1301001130033 is 3300311001031.
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 a cyclic number.
It is not a de Polignac number, because 1301001130033 - 25 = 1301001130001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1301001129989 and 1301001130016.
It is not an unprimeable number, because it can be changed into a prime (1301001130043) 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, 59136414991 + ... + 59136415012.
It is an arithmetic number, because the mean of its divisors is an integer number (354818490012).
Almost surely, 21301001130033 is an apocalyptic number.
It is an amenable number.
1301001130033 is a deficient number, since it is larger than the sum of its proper divisors (118272830015).
1301001130033 is a wasteful number, since it uses less digits than its factorization.
1301001130033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118272830014.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 1301001130033 its reverse (3300311001031), we get a palindrome (4601312131064).
The spelling of 1301001130033 in words is "one trillion, three hundred one billion, one million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •