Base | Representation |
---|---|
bin | 1001000110101011011001… |
… | …0010001010000111011111 |
3 | 1022102222102020201220012101 |
4 | 2101222312102022013133 |
5 | 2303002124443404043 |
6 | 33142403311545531 |
7 | 2052136234120246 |
oct | 221526622120737 |
9 | 38388366656171 |
10 | 10010332013023 |
11 | 320a3a34a8361 |
12 | 115809bb2b2a7 |
13 | 577c7c871ab4 |
14 | 2687073d995d |
15 | 1255d203524d |
hex | 91ab648a1df |
10010332013023 has 8 divisors (see below), whose sum is σ = 10048951999296. Its totient is φ = 9971724391200.
The previous prime is 10010332012997. The next prime is 10010332013053. The reversal of 10010332013023 is 32031023301001.
10010332013023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10010332013023 - 29 = 10010332012511 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 (10010332013053) 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, 1467136 + ... + 4708837.
It is an arithmetic number, because the mean of its divisors is an integer number (1256118999912).
Almost surely, 210010332013023 is an apocalyptic number.
10010332013023 is a deficient number, since it is larger than the sum of its proper divisors (38619986273).
10010332013023 is an equidigital number, since it uses as much as digits as its factorization.
10010332013023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6182225.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10010332013023 its reverse (32031023301001), we get a palindrome (42041355314024).
The spelling of 10010332013023 in words is "ten trillion, ten billion, three hundred thirty-two million, thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •