Base | Representation |
---|---|
bin | 1001001100101011000011… |
… | …1010000011011001111101 |
3 | 1022210211020201201200110001 |
4 | 2103022300322003121331 |
5 | 2311144040140214401 |
6 | 33301555011514301 |
7 | 2062443344216662 |
oct | 223126072033175 |
9 | 38724221650401 |
10 | 10113321023101 |
11 | 324a043077a1a |
12 | 11740428b8991 |
13 | 5848b36b874a |
14 | 26d6b7401a69 |
15 | 12810d892601 |
hex | 932b0e8367d |
10113321023101 has 8 divisors (see below), whose sum is σ = 10729681632000. Its totient is φ = 9499344788928.
The previous prime is 10113321023087. The next prime is 10113321023153. The reversal of 10113321023101 is 10132012331101.
10113321023101 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 de Polignac number, because none of the positive numbers 2k-10113321023101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113321023401) 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, 596084941 + ... + 596101906.
It is an arithmetic number, because the mean of its divisors is an integer number (1341210204000).
Almost surely, 210113321023101 is an apocalyptic number.
It is an amenable number.
10113321023101 is a deficient number, since it is larger than the sum of its proper divisors (616360608899).
10113321023101 is a wasteful number, since it uses less digits than its factorization.
10113321023101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1192187363.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10113321023101 its reverse (10132012331101), we get a palindrome (20245333354202).
The spelling of 10113321023101 in words is "ten trillion, one hundred thirteen billion, three hundred twenty-one million, twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •