Base | Representation |
---|---|
bin | 11101111110110001011… |
… | …01100010111100100101 |
3 | 10122110221201222112022221 |
4 | 32333120231202330211 |
5 | 113334203022031041 |
6 | 2105123033152341 |
7 | 134265441020614 |
oct | 16773055427445 |
9 | 3573851875287 |
10 | 1030133002021 |
11 | 367971251352 |
12 | 14779155b6b1 |
13 | 761ab08a956 |
14 | 37c043d387b |
15 | 1bbe1db32d1 |
hex | efd8b62f25 |
1030133002021 has 2 divisors, whose sum is σ = 1030133002022. Its totient is φ = 1030133002020.
The previous prime is 1030133002007. The next prime is 1030133002091. The reversal of 1030133002021 is 1202003310301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 950205796225 + 79927205796 = 974785^2 + 282714^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030133002021 - 227 = 1029998784293 is a prime.
It is a super-2 number, since 2×10301330020212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030133001986 and 1030133002004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030133002091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515066501010 + 515066501011.
It is an arithmetic number, because the mean of its divisors is an integer number (515066501011).
Almost surely, 21030133002021 is an apocalyptic number.
It is an amenable number.
1030133002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030133002021 is an equidigital number, since it uses as much as digits as its factorization.
1030133002021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1030133002021 its reverse (1202003310301), we get a palindrome (2232136312322).
The spelling of 1030133002021 in words is "one trillion, thirty billion, one hundred thirty-three million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •