Base | Representation |
---|---|
bin | 11011010110100110011001… |
… | …011011001010111000111011 |
3 | 120202221121010122201122101210 |
4 | 123112212121123022320323 |
5 | 111232000020113431303 |
6 | 1103505111215214203 |
7 | 34224260621626155 |
oct | 3326463133127073 |
9 | 522847118648353 |
10 | 120300313030203 |
11 | 35371092534759 |
12 | 115ab00b517363 |
13 | 521836a069247 |
14 | 219c7cd9b7ad5 |
15 | dd9449549203 |
hex | 6d69996cae3b |
120300313030203 has 8 divisors (see below), whose sum is σ = 160403570906688. Its totient is φ = 80198631920264.
The previous prime is 120300313030187. The next prime is 120300313030229. The reversal of 120300313030203 is 302030313003021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120300313030203 - 24 = 120300313030187 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120300313030203.
It is not an unprimeable number, because it can be changed into a prime (120300313030603) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 394013601 + ... + 394318802.
It is an arithmetic number, because the mean of its divisors is an integer number (20050446363336).
Almost surely, 2120300313030203 is an apocalyptic number.
120300313030203 is a deficient number, since it is larger than the sum of its proper divisors (40103257876485).
120300313030203 is an equidigital number, since it uses as much as digits as its factorization.
120300313030203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788383273.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 120300313030203 its reverse (302030313003021), we get a palindrome (422330626033224).
The spelling of 120300313030203 in words is "one hundred twenty trillion, three hundred billion, three hundred thirteen million, thirty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •