Base | Representation |
---|---|
bin | 1101110100110110101001… |
… | …11110000001100100101011 |
3 | 10222122112100211210112002201 |
4 | 12322123110332001210223 |
5 | 12441112030444102001 |
6 | 144355035030441031 |
7 | 6255366252114601 |
oct | 672332476014453 |
9 | 128575324715081 |
10 | 30403351550251 |
11 | 9761a97377799 |
12 | 34b0458b03177 |
13 | 13c704023b804 |
14 | 77175c707871 |
15 | 37acdaa59501 |
hex | 1ba6d4f8192b |
30403351550251 has 4 divisors (see below), whose sum is σ = 30788204101600. Its totient is φ = 30018498998904.
The previous prime is 30403351550249. The next prime is 30403351550263. The reversal of 30403351550251 is 15205515330403.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30403351550251 - 21 = 30403351550249 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30403351550251.
It is not an unprimeable number, because it can be changed into a prime (30403351550281) 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, 192426275556 + ... + 192426275713.
It is an arithmetic number, because the mean of its divisors is an integer number (7697051025400).
Almost surely, 230403351550251 is an apocalyptic number.
30403351550251 is a deficient number, since it is larger than the sum of its proper divisors (384852551349).
30403351550251 is an equidigital number, since it uses as much as digits as its factorization.
30403351550251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 384852551348.
The product of its (nonzero) digits is 135000, while the sum is 37.
Adding to 30403351550251 its reverse (15205515330403), we get a palindrome (45608866880654).
The spelling of 30403351550251 in words is "thirty trillion, four hundred three billion, three hundred fifty-one million, five hundred fifty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •