Base | Representation |
---|---|
bin | 11100001000001000… |
… | …110101000101101001 |
3 | 2212221210002011201122 |
4 | 130020020311011221 |
5 | 443323013202101 |
6 | 21512502425025 |
7 | 2116262562143 |
oct | 341010650551 |
9 | 85853064648 |
10 | 30201303401 |
11 | 11898937285 |
12 | 5a2a432175 |
13 | 2b03cb7739 |
14 | 1667089c93 |
15 | bbb63e51b |
hex | 708235169 |
30201303401 has 4 divisors (see below), whose sum is σ = 30202716804. Its totient is φ = 30199890000.
The previous prime is 30201303397. The next prime is 30201303413. The reversal of 30201303401 is 10430310203.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27464444176 + 2736859225 = 165724^2 + 52315^2 .
It is a cyclic number.
It is not a de Polignac number, because 30201303401 - 22 = 30201303397 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30201303401.
It is not an unprimeable number, because it can be changed into a prime (30201303421) 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, 674150 + ... + 717551.
It is an arithmetic number, because the mean of its divisors is an integer number (7550679201).
Almost surely, 230201303401 is an apocalyptic number.
It is an amenable number.
30201303401 is a deficient number, since it is larger than the sum of its proper divisors (1413403).
30201303401 is a wasteful number, since it uses less digits than its factorization.
30201303401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1413402.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 30201303401 its reverse (10430310203), we get a palindrome (40631613604).
The spelling of 30201303401 in words is "thirty billion, two hundred one million, three hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •