Base | Representation |
---|---|
bin | 10010111011110001011… |
… | …110000110001010110001 |
3 | 11121101110002010120022012 |
4 | 102323301132012022301 |
5 | 132304204104301113 |
6 | 2433421555452305 |
7 | 163001150520344 |
oct | 22736136061261 |
9 | 4541402116265 |
10 | 1301131322033 |
11 | 461896790184 |
12 | 1902022b7095 |
13 | 959085c3a6a |
14 | 46d9191c45b |
15 | 23ca33e6aa8 |
hex | 12ef17862b1 |
1301131322033 has 4 divisors (see below), whose sum is σ = 1306715576868. Its totient is φ = 1295547067200.
The previous prime is 1301131322011. The next prime is 1301131322039. The reversal of 1301131322033 is 3302231311031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 686738717809 + 614392604224 = 828697^2 + 783832^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301131322033 - 236 = 1232411845297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1301131322039) 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, 2792127068 + ... + 2792127533.
It is an arithmetic number, because the mean of its divisors is an integer number (326678894217).
Almost surely, 21301131322033 is an apocalyptic number.
It is an amenable number.
1301131322033 is a deficient number, since it is larger than the sum of its proper divisors (5584254835).
1301131322033 is an equidigital number, since it uses as much as digits as its factorization.
1301131322033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5584254834.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1301131322033 its reverse (3302231311031), we get a palindrome (4603362633064).
The spelling of 1301131322033 in words is "one trillion, three hundred one billion, one hundred thirty-one million, three hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •