Base | Representation |
---|---|
bin | 1001000110101111000101… |
… | …0000000110110101011001 |
3 | 1022110001222012022110101011 |
4 | 2101223301100012311121 |
5 | 2303011141230043113 |
6 | 33143045412253521 |
7 | 2052202606151311 |
oct | 221536120066531 |
9 | 38401865273334 |
10 | 10011321331033 |
11 | 320a860995650 |
12 | 11583173112a1 |
13 | 5780a980bb79 |
14 | 26879c966441 |
15 | 12563dd0663d |
hex | 91af1406d59 |
10011321331033 has 8 divisors (see below), whose sum is σ = 10924591606560. Its totient is φ = 9098576081280.
The previous prime is 10011321330979. The next prime is 10011321331049. The reversal of 10011321331033 is 33013312311001.
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 10011321331033 - 229 = 10010784460121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011321330995 and 10011321331013.
It is not an unprimeable number, because it can be changed into a prime (10011321337033) 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, 131216568 + ... + 131292841.
It is an arithmetic number, because the mean of its divisors is an integer number (1365573950820).
Almost surely, 210011321331033 is an apocalyptic number.
It is an amenable number.
10011321331033 is a deficient number, since it is larger than the sum of its proper divisors (913270275527).
10011321331033 is a wasteful number, since it uses less digits than its factorization.
10011321331033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262512887.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 10011321331033 its reverse (33013312311001), we get a palindrome (43024633642034).
The spelling of 10011321331033 in words is "ten trillion, eleven billion, three hundred twenty-one million, three hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •