Base | Representation |
---|---|
bin | 1101101111110101110100… |
… | …01010010110000001111111 |
3 | 10222001001202112221210100010 |
4 | 12313322322022112001333 |
5 | 12430301244343244403 |
6 | 144143551012434303 |
7 | 6240060626351130 |
oct | 667727212260177 |
9 | 128031675853303 |
10 | 30231103103103 |
11 | 96a5a3663aa41 |
12 | 3482ba7318993 |
13 | 13b3a1c51c736 |
14 | 76729c1c1c87 |
15 | 3765a8b22603 |
hex | 1b7eba29607f |
30231103103103 has 32 divisors (see below), whose sum is σ = 48861152778240. Its totient is φ = 16240780838880.
The previous prime is 30231103103087. The next prime is 30231103103137. The reversal of 30231103103103 is 30130130113203.
It is not a de Polignac number, because 30231103103103 - 24 = 30231103103087 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 30231103103103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30231103183103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 289135425 + ... + 289239962.
It is an arithmetic number, because the mean of its divisors is an integer number (1526911024320).
Almost surely, 230231103103103 is an apocalyptic number.
30231103103103 is a deficient number, since it is larger than the sum of its proper divisors (18630049675137).
30231103103103 is a wasteful number, since it uses less digits than its factorization.
30231103103103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578375547.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 30231103103103 its reverse (30130130113203), we get a palindrome (60361233216306).
The spelling of 30231103103103 in words is "thirty trillion, two hundred thirty-one billion, one hundred three million, one hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •