Base | Representation |
---|---|
bin | 11101011100111111111… |
… | …10010101100001111101 |
3 | 10120202011002212020012221 |
4 | 32232133332111201331 |
5 | 113040034303424041 |
6 | 2052523522325341 |
7 | 133054222356412 |
oct | 16563776254175 |
9 | 3522132766187 |
10 | 1012001233021 |
11 | 360207349999 |
12 | 1441711b9851 |
13 | 7457b77265c |
14 | 36da42a6109 |
15 | 1b4d017c2d1 |
hex | eb9ff9587d |
1012001233021 has 2 divisors, whose sum is σ = 1012001233022. Its totient is φ = 1012001233020.
The previous prime is 1012001233013. The next prime is 1012001233051. The reversal of 1012001233021 is 1203321002101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 966851357796 + 45149875225 = 983286^2 + 212485^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012001233021 - 23 = 1012001233013 is a prime.
It is a super-3 number, since 3×10120012330213 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012001232986 and 1012001233004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012001233051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506000616510 + 506000616511.
It is an arithmetic number, because the mean of its divisors is an integer number (506000616511).
Almost surely, 21012001233021 is an apocalyptic number.
It is an amenable number.
1012001233021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012001233021 is an equidigital number, since it uses as much as digits as its factorization.
1012001233021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1012001233021 its reverse (1203321002101), we get a palindrome (2215322235122).
The spelling of 1012001233021 in words is "one trillion, twelve billion, one million, two hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •