Base | Representation |
---|---|
bin | 1001000111011010111111… |
… | …1011011101110110011101 |
3 | 1022111012101210100021212110 |
4 | 2101312233323131312131 |
5 | 2303204312214200013 |
6 | 33152315303024233 |
7 | 2053101005600334 |
oct | 221665773356635 |
9 | 38435353307773 |
10 | 10023110303133 |
11 | 32148605118a4 |
12 | 115a66743b079 |
13 | 5792380279c5 |
14 | 26919a530d1b |
15 | 125acdc902c3 |
hex | 91dafeddd9d |
10023110303133 has 8 divisors (see below), whose sum is σ = 13364815592128. Its totient is φ = 6681739274784.
The previous prime is 10023110303099. The next prime is 10023110303149. The reversal of 10023110303133 is 33130301132001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10023110303133 - 228 = 10022841867677 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 (10023110303333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83495185 + ... + 83615142.
It is an arithmetic number, because the mean of its divisors is an integer number (1670601949016).
Almost surely, 210023110303133 is an apocalyptic number.
It is an amenable number.
10023110303133 is a deficient number, since it is larger than the sum of its proper divisors (3341705288995).
10023110303133 is a wasteful number, since it uses less digits than its factorization.
10023110303133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167130323.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 10023110303133 its reverse (33130301132001), we get a palindrome (43153411435134).
The spelling of 10023110303133 in words is "ten trillion, twenty-three billion, one hundred ten million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.432 sec. • engine limits •