Base | Representation |
---|---|
bin | 1101101001110010110011… |
… | …00000001100010000110111 |
3 | 10221022012110000001102122010 |
4 | 12310321121200030100313 |
5 | 12413400231142310403 |
6 | 143504305120135303 |
7 | 6216053634612213 |
oct | 664713140142067 |
9 | 127265400042563 |
10 | 30023323010103 |
11 | 9625902150815 |
12 | 344a87a167533 |
13 | 139a2583c4747 |
14 | 75b1cab1b943 |
15 | 370e97640603 |
hex | 1b4e5980c437 |
30023323010103 has 8 divisors (see below), whose sum is σ = 40252263631216. Its totient is φ = 19904965531200.
The previous prime is 30023323010099. The next prime is 30023323010141. The reversal of 30023323010103 is 30101032332003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30023323010103 - 22 = 30023323010099 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 30023323010103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30023323010803) 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, 27645784918 + ... + 27645786003.
It is an arithmetic number, because the mean of its divisors is an integer number (5031532953902).
Almost surely, 230023323010103 is an apocalyptic number.
30023323010103 is a deficient number, since it is larger than the sum of its proper divisors (10228940621113).
30023323010103 is a wasteful number, since it uses less digits than its factorization.
30023323010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55291571105.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30023323010103 its reverse (30101032332003), we get a palindrome (60124355342106).
The spelling of 30023323010103 in words is "thirty trillion, twenty-three billion, three hundred twenty-three million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •