Base | Representation |
---|---|
bin | 11101111110100101001… |
… | …01011110001011000101 |
3 | 10122110200120120202200021 |
4 | 32333102211132023011 |
5 | 113334000214101041 |
6 | 2105104522215141 |
7 | 134263052266513 |
oct | 16772245361305 |
9 | 3573616522607 |
10 | 1030030222021 |
11 | 3679192311a9 |
12 | 1477630544b1 |
13 | 761929b2998 |
14 | 37bd48bb4b3 |
15 | 1bbd7d5ecd1 |
hex | efd295e2c5 |
1030030222021 has 16 divisors (see below), whose sum is σ = 1037324844864. Its totient is φ = 1022768740224.
The previous prime is 1030030222019. The next prime is 1030030222043. The reversal of 1030030222021 is 1202220300301.
It is a cyclic number.
It is not a de Polignac number, because 1030030222021 - 21 = 1030030222019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030030221986 and 1030030222004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030030222621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 91609626 + ... + 91620868.
It is an arithmetic number, because the mean of its divisors is an integer number (64832802804).
Almost surely, 21030030222021 is an apocalyptic number.
It is an amenable number.
1030030222021 is a deficient number, since it is larger than the sum of its proper divisors (7294622843).
1030030222021 is a wasteful number, since it uses less digits than its factorization.
1030030222021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12660.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1030030222021 its reverse (1202220300301), we get a palindrome (2232250522322).
The spelling of 1030030222021 in words is "one trillion, thirty billion, thirty million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •