Base | Representation |
---|---|
bin | 10011000110000000100… |
… | …000100001000101001001 |
3 | 11122102210222012201200112 |
4 | 103012000200201011021 |
5 | 132444210441024113 |
6 | 2442440255244105 |
7 | 163540403521166 |
oct | 23060040410511 |
9 | 4572728181615 |
10 | 1312121033033 |
11 | 466516130768 |
12 | 19236a819635 |
13 | 9696a358135 |
14 | 477152b106d |
15 | 241e81025a8 |
hex | 13180821149 |
1312121033033 has 8 divisors (see below), whose sum is σ = 1317198558600. Its totient is φ = 1307044987648.
The previous prime is 1312121033021. The next prime is 1312121033063. The reversal of 1312121033033 is 3303301212131.
It can be written as a sum of positive squares in 4 ways, for example, as 48852934729 + 1263268098304 = 221027^2 + 1123952^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 1312121033033 - 28 = 1312121032777 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1312121033063) 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, 1423073 + ... + 2156241.
It is an arithmetic number, because the mean of its divisors is an integer number (164649819825).
Almost surely, 21312121033033 is an apocalyptic number.
It is an amenable number.
1312121033033 is a deficient number, since it is larger than the sum of its proper divisors (5077525567).
1312121033033 is an equidigital number, since it uses as much as digits as its factorization.
1312121033033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 740091.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1312121033033 its reverse (3303301212131), we get a palindrome (4615422245164).
The spelling of 1312121033033 in words is "one trillion, three hundred twelve billion, one hundred twenty-one million, thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •