Base | Representation |
---|---|
bin | 11101011101100111100… |
… | …00011100010001110001 |
3 | 10120210000020101121002101 |
4 | 32232303300130101301 |
5 | 113041224240304321 |
6 | 2053020500220401 |
7 | 133065362445511 |
oct | 16566360342161 |
9 | 3523006347071 |
10 | 1012333134961 |
11 | 360367732815 |
12 | 14424439a701 |
13 | 74602460035 |
14 | 36dd63c1841 |
15 | 1b4ee38d791 |
hex | ebb3c1c471 |
1012333134961 has 2 divisors, whose sum is σ = 1012333134962. Its totient is φ = 1012333134960.
The previous prime is 1012333134959. The next prime is 1012333134977. The reversal of 1012333134961 is 1694313332101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 850342179600 + 161990955361 = 922140^2 + 402481^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012333134961 - 21 = 1012333134959 is a prime.
It is a super-2 number, since 2×10123331349612 (a number of 25 digits) contains 22 as substring.
Together with 1012333134959, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1012333134961.
It is not a weakly prime, because it can be changed into another prime (1012333134931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506166567480 + 506166567481.
It is an arithmetic number, because the mean of its divisors is an integer number (506166567481).
Almost surely, 21012333134961 is an apocalyptic number.
It is an amenable number.
1012333134961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012333134961 is an equidigital number, since it uses as much as digits as its factorization.
1012333134961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 37.
The spelling of 1012333134961 in words is "one trillion, twelve billion, three hundred thirty-three million, one hundred thirty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •