Base | Representation |
---|---|
bin | 11100001001010000… |
… | …001110111000110101 |
3 | 2220000002022010212012 |
4 | 130021100032320311 |
5 | 443342311140201 |
6 | 21514411534005 |
7 | 2116610641241 |
oct | 341120167065 |
9 | 86002263765 |
10 | 30220021301 |
11 | 118a8461318 |
12 | 5a3475a305 |
13 | 2b07b3c412 |
14 | 166975d421 |
15 | bbd0da5bb |
hex | 70940ee35 |
30220021301 has 4 divisors (see below), whose sum is σ = 30289813932. Its totient is φ = 30150228672.
The previous prime is 30220021277. The next prime is 30220021327. The reversal of 30220021301 is 10312002203.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10312002203 = 41233 ⋅250091.
It can be written as a sum of positive squares in 2 ways, for example, as 4173289201 + 26046732100 = 64601^2 + 161390^2 .
It is a cyclic number.
It is not a de Polignac number, because 30220021301 - 222 = 30215826997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30220021001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34895666 + ... + 34896531.
It is an arithmetic number, because the mean of its divisors is an integer number (7572453483).
Almost surely, 230220021301 is an apocalyptic number.
It is an amenable number.
30220021301 is a deficient number, since it is larger than the sum of its proper divisors (69792631).
30220021301 is an equidigital number, since it uses as much as digits as its factorization.
30220021301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69792630.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 30220021301 its reverse (10312002203), we get a palindrome (40532023504).
The spelling of 30220021301 in words is "thirty billion, two hundred twenty million, twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •