Base | Representation |
---|---|
bin | 11100010101110101… |
… | …000110000011000101 |
3 | 2220112210022112022222 |
4 | 130111311012003011 |
5 | 444310314323023 |
6 | 21551350102125 |
7 | 2125052216504 |
oct | 342565060305 |
9 | 86483275288 |
10 | 30431011013 |
11 | 119a656aa87 |
12 | 5a9334a945 |
13 | 2b3c7738c0 |
14 | 16897a283b |
15 | bd18b5cc8 |
hex | 715d460c5 |
30431011013 has 8 divisors (see below), whose sum is σ = 33309102456. Its totient is φ = 27629668800.
The previous prime is 30431010949. The next prime is 30431011067. The reversal of 30431011013 is 31011013403.
It can be written as a sum of positive squares in 4 ways, for example, as 454243969 + 29976767044 = 21313^2 + 173138^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 30431011013 - 26 = 30431010949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30431010982 and 30431011000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30431011813) 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, 19186478 + ... + 19188063.
It is an arithmetic number, because the mean of its divisors is an integer number (4163637807).
Almost surely, 230431011013 is an apocalyptic number.
It is an amenable number.
30431011013 is a deficient number, since it is larger than the sum of its proper divisors (2878091443).
30431011013 is a wasteful number, since it uses less digits than its factorization.
30431011013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38374615.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 30431011013 its reverse (31011013403), we get a palindrome (61442024416).
The spelling of 30431011013 in words is "thirty billion, four hundred thirty-one million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •