Base | Representation |
---|---|
bin | 1101101111110011111101… |
… | …00000100111110011010111 |
3 | 10222000222011210210020102201 |
4 | 12313321332200213303113 |
5 | 12430242222142410403 |
6 | 144143303422145331 |
7 | 6240024054635233 |
oct | 667717640476327 |
9 | 128028153706381 |
10 | 30230102310103 |
11 | 96a5572725393 |
12 | 3482968122247 |
13 | 13b38c0095627 |
14 | 7672053095c3 |
15 | 37654ad3621d |
hex | 1b7e7e827cd7 |
30230102310103 has 4 divisors (see below), whose sum is σ = 32008343622480. Its totient is φ = 28451860997728.
The previous prime is 30230102310029. The next prime is 30230102310143. The reversal of 30230102310103 is 30101320103203.
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 30230102310103 - 237 = 30092663356631 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 (30230102310143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 889120656163 + ... + 889120656196.
It is an arithmetic number, because the mean of its divisors is an integer number (8002085905620).
Almost surely, 230230102310103 is an apocalyptic number.
30230102310103 is a deficient number, since it is larger than the sum of its proper divisors (1778241312377).
30230102310103 is a wasteful number, since it uses less digits than its factorization.
30230102310103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1778241312376.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30230102310103 its reverse (30101320103203), we get a palindrome (60331422413306).
The spelling of 30230102310103 in words is "thirty trillion, two hundred thirty billion, one hundred two million, three hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •