Base | Representation |
---|---|
bin | 11100001110101000… |
… | …101010100011000101 |
3 | 2220020101012101121002 |
4 | 130032220222203011 |
5 | 444033414442013 |
6 | 21531355103045 |
7 | 2122055254643 |
oct | 341650524305 |
9 | 86211171532 |
10 | 30310312133 |
11 | 11944421142 |
12 | 5a5aa41a85 |
13 | 2b2076384a |
14 | 1677744193 |
15 | bc5ec3358 |
hex | 70ea2a8c5 |
30310312133 has 4 divisors (see below), whose sum is σ = 31355495340. Its totient is φ = 29265128928.
The previous prime is 30310312121. The next prime is 30310312139. The reversal of 30310312133 is 33121301303.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33121301303 = 43 ⋅770262821.
It can be written as a sum of positive squares in 2 ways, for example, as 14654797249 + 15655514884 = 121057^2 + 125122^2 .
It is a cyclic number.
It is not a de Polignac number, because 30310312133 - 28 = 30310311877 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 (30310312139) 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, 522591560 + ... + 522591617.
It is an arithmetic number, because the mean of its divisors is an integer number (7838873835).
Almost surely, 230310312133 is an apocalyptic number.
It is an amenable number.
30310312133 is a deficient number, since it is larger than the sum of its proper divisors (1045183207).
30310312133 is a wasteful number, since it uses less digits than its factorization.
30310312133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1045183206.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 30310312133 its reverse (33121301303), we get a palindrome (63431613436).
The spelling of 30310312133 in words is "thirty billion, three hundred ten million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •