Base | Representation |
---|---|
bin | 11101111110101111000… |
… | …10000000011110010101 |
3 | 10122110220100201111002112 |
4 | 32333113202000132111 |
5 | 113334132434400041 |
6 | 2105121044520405 |
7 | 134265110505053 |
oct | 16772742003625 |
9 | 3573810644075 |
10 | 1030113200021 |
11 | 367961056864 |
12 | 1477869b0105 |
13 | 761a6c466a9 |
14 | 37c0191b1d3 |
15 | 1bbe02a0deb |
hex | efd7880795 |
1030113200021 has 2 divisors, whose sum is σ = 1030113200022. Its totient is φ = 1030113200020.
The previous prime is 1030113200003. The next prime is 1030113200059. The reversal of 1030113200021 is 1200023110301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1029392868100 + 720331921 = 1014590^2 + 26839^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030113200021 - 214 = 1030113183637 is a prime.
It is a super-2 number, since 2×10301132000212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030113199969 and 1030113200005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030113230021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515056600010 + 515056600011.
It is an arithmetic number, because the mean of its divisors is an integer number (515056600011).
Almost surely, 21030113200021 is an apocalyptic number.
It is an amenable number.
1030113200021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030113200021 is an equidigital number, since it uses as much as digits as its factorization.
1030113200021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1030113200021 its reverse (1200023110301), we get a palindrome (2230136310322).
The spelling of 1030113200021 in words is "one trillion, thirty billion, one hundred thirteen million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •