Base | Representation |
---|---|
bin | 1001011001010110000001… |
… | …1011101111110000001111 |
3 | 1100120122011010220120012121 |
4 | 2112111200123233300033 |
5 | 2323230404120424403 |
6 | 33550000304513411 |
7 | 2114251110036424 |
oct | 226254033576017 |
9 | 40518133816177 |
10 | 10331014233103 |
11 | 33233a4229723 |
12 | 11aa27791b867 |
13 | 59c297500945 |
14 | 27a04928dd4b |
15 | 12db002be3bd |
hex | 965606efc0f |
10331014233103 has 8 divisors (see below), whose sum is σ = 10888902446400. Its totient is φ = 9786569109408.
The previous prime is 10331014233073. The next prime is 10331014233109. The reversal of 10331014233103 is 30133241013301.
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 10331014233103 - 225 = 10330980678671 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 (10331014233109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3360770823 + ... + 3360773896.
It is an arithmetic number, because the mean of its divisors is an integer number (1361112805800).
Almost surely, 210331014233103 is an apocalyptic number.
10331014233103 is a deficient number, since it is larger than the sum of its proper divisors (557888213297).
10331014233103 is an equidigital number, since it uses as much as digits as its factorization.
10331014233103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6721544801.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 10331014233103 its reverse (30133241013301), we get a palindrome (40464255246404).
The spelling of 10331014233103 in words is "ten trillion, three hundred thirty-one billion, fourteen million, two hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •