Base | Representation |
---|---|
bin | 1001001000000100110010… |
… | …1111001001001001010111 |
3 | 1022112021100210010021120211 |
4 | 2102001030233021021113 |
5 | 2303400302220430403 |
6 | 33201412534110251 |
7 | 2053646035315132 |
oct | 222011457111127 |
9 | 38467323107524 |
10 | 10034331030103 |
11 | 32195992aa076 |
12 | 11608791ab387 |
13 | 57a3058b5913 |
14 | 26994285b219 |
15 | 126038dd006d |
hex | 9204cbc9257 |
10034331030103 has 8 divisors (see below), whose sum is σ = 10038961191296. Its totient is φ = 10029701167200.
The previous prime is 10034331030043. The next prime is 10034331030121. The reversal of 10034331030103 is 30103013343001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10034331030103 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 (10034311030103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94085338 + ... + 94191928.
It is an arithmetic number, because the mean of its divisors is an integer number (1254870148912).
Almost surely, 210034331030103 is an apocalyptic number.
10034331030103 is a deficient number, since it is larger than the sum of its proper divisors (4630161193).
10034331030103 is a wasteful number, since it uses less digits than its factorization.
10034331030103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149145.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 10034331030103 its reverse (30103013343001), we get a palindrome (40137344373104).
The spelling of 10034331030103 in words is "ten trillion, thirty-four billion, three hundred thirty-one million, thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •