Base | Representation |
---|---|
bin | 11100101000111010… |
… | …101101011010000101 |
3 | 2221101002220100201011 |
4 | 130220322231122011 |
5 | 1000434310000203 |
6 | 22043230002221 |
7 | 2136021212146 |
oct | 345072553205 |
9 | 87332810634 |
10 | 30751250053 |
11 | 12050308347 |
12 | 5b62646371 |
13 | 2b90c09864 |
14 | 16ba123acd |
15 | beea7176d |
hex | 728ead685 |
30751250053 has 4 divisors (see below), whose sum is σ = 30779385868. Its totient is φ = 30723114240.
The previous prime is 30751250051. The next prime is 30751250069. The reversal of 30751250053 is 35005215703.
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 19039032324 + 11712217729 = 137982^2 + 108223^2 .
It is a cyclic number.
It is not a de Polignac number, because 30751250053 - 21 = 30751250051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30751249997 and 30751250024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30751250051) 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, 14066268 + ... + 14068453.
It is an arithmetic number, because the mean of its divisors is an integer number (7694846467).
Almost surely, 230751250053 is an apocalyptic number.
It is an amenable number.
30751250053 is a deficient number, since it is larger than the sum of its proper divisors (28135815).
30751250053 is a wasteful number, since it uses less digits than its factorization.
30751250053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28135814.
The product of its (nonzero) digits is 15750, while the sum is 31.
Adding to 30751250053 its reverse (35005215703), we get a palindrome (65756465756).
The spelling of 30751250053 in words is "thirty billion, seven hundred fifty-one million, two hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •