Base | Representation |
---|---|
bin | 11100001000001000… |
… | …000011111010111101 |
3 | 2212221202200221110211 |
4 | 130020020003322331 |
5 | 443322440231023 |
6 | 21512454232421 |
7 | 2116261063045 |
oct | 341010037275 |
9 | 85852627424 |
10 | 30201102013 |
11 | 11898809a45 |
12 | 5a2a355711 |
13 | 2b03c46b84 |
14 | 1667036725 |
15 | bbb5eea0d |
hex | 708203ebd |
30201102013 has 8 divisors (see below), whose sum is σ = 30751346520. Its totient is φ = 29652636480.
The previous prime is 30201101981. The next prime is 30201102047. The reversal of 30201102013 is 31020110203.
It can be written as a sum of positive squares in 4 ways, for example, as 588887289 + 29612214724 = 24267^2 + 172082^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30201102013 - 25 = 30201101981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30201101984 and 30201102002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201102713) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 410458 + ... + 478411.
It is an arithmetic number, because the mean of its divisors is an integer number (3843918315).
Almost surely, 230201102013 is an apocalyptic number.
It is an amenable number.
30201102013 is a deficient number, since it is larger than the sum of its proper divisors (550244507).
30201102013 is an equidigital number, since it uses as much as digits as its factorization.
30201102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 889487.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 30201102013 its reverse (31020110203), we get a palindrome (61221212216).
The spelling of 30201102013 in words is "thirty billion, two hundred one million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •