Base | Representation |
---|---|
bin | 11011111110000000… |
… | …010100101001011101 |
3 | 2212111221012011120022 |
4 | 123332000110221131 |
5 | 443001003114323 |
6 | 21443551001525 |
7 | 2112126564014 |
oct | 337600245135 |
9 | 85457164508 |
10 | 30031301213 |
11 | 11810983101 |
12 | 59a15092a5 |
13 | 2aa7a04424 |
14 | 164c675a7b |
15 | bab75d4c8 |
hex | 6fe014a5d |
30031301213 has 4 divisors (see below), whose sum is σ = 30088943388. Its totient is φ = 29973659040.
The previous prime is 30031301189. The next prime is 30031301249. The reversal of 30031301213 is 31210313003.
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 3624401209 + 26406900004 = 60203^2 + 162502^2 .
It is a cyclic number.
It is not a de Polignac number, because 30031301213 - 26 = 30031301149 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30031301191 and 30031301200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30031301513) 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, 28820306 + ... + 28821347.
It is an arithmetic number, because the mean of its divisors is an integer number (7522235847).
Almost surely, 230031301213 is an apocalyptic number.
It is an amenable number.
30031301213 is a deficient number, since it is larger than the sum of its proper divisors (57642175).
30031301213 is an equidigital number, since it uses as much as digits as its factorization.
30031301213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57642174.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 30031301213 its reverse (31210313003), we get a palindrome (61241614216).
The spelling of 30031301213 in words is "thirty billion, thirty-one million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •