Base | Representation |
---|---|
bin | 1101101100100110111000… |
… | …00101100101011101010111 |
3 | 10221122102222210202110012210 |
4 | 12312103130011211131113 |
5 | 12421441231300144343 |
6 | 144020534410444503 |
7 | 6226045520232435 |
oct | 666233405453527 |
9 | 127572883673183 |
10 | 30120003131223 |
11 | 96629045a4765 |
12 | 3465560133733 |
13 | 13a63c51818c5 |
14 | 761b5cca9d55 |
15 | 37375519c333 |
hex | 1b64dc165757 |
30120003131223 has 8 divisors (see below), whose sum is σ = 41455488180736. Its totient is φ = 19432260084600.
The previous prime is 30120003131219. The next prime is 30120003131249. The reversal of 30120003131223 is 32213130002103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30120003131223 - 22 = 30120003131219 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 30120003131223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30120003131203) 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, 161935500613 + ... + 161935500798.
It is an arithmetic number, because the mean of its divisors is an integer number (5181936022592).
Almost surely, 230120003131223 is an apocalyptic number.
30120003131223 is a deficient number, since it is larger than the sum of its proper divisors (11335485049513).
30120003131223 is a wasteful number, since it uses less digits than its factorization.
30120003131223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323871001445.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30120003131223 its reverse (32213130002103), we get a palindrome (62333133133326).
The spelling of 30120003131223 in words is "thirty trillion, one hundred twenty billion, three million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •