Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …1010100010101010101101 |
3 | 1022102221211022210110012110 |
4 | 2101222220222202222231 |
5 | 2303001143000232023 |
6 | 33142324510354233 |
7 | 2052130461026445 |
oct | 221525052425255 |
9 | 38387738713173 |
10 | 10010103524013 |
11 | 320a29652716a |
12 | 11580374bb979 |
13 | 577c444214b8 |
14 | 2686c4d1d125 |
15 | 1255bbe4ea93 |
hex | 91aa8aa2aad |
10010103524013 has 8 divisors (see below), whose sum is σ = 13423953859488. Its totient is φ = 6634827768944.
The previous prime is 10010103523957. The next prime is 10010103524017. The reversal of 10010103524013 is 31042530101001.
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 10010103524013 - 210 = 10010103522989 is a prime.
It is a super-2 number, since 2×100101035240132 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010103524017) 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, 9643644495 + ... + 9643645532.
It is an arithmetic number, because the mean of its divisors is an integer number (1677994232436).
Almost surely, 210010103524013 is an apocalyptic number.
It is an amenable number.
10010103524013 is a deficient number, since it is larger than the sum of its proper divisors (3413850335475).
10010103524013 is a wasteful number, since it uses less digits than its factorization.
10010103524013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19287290203.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 10010103524013 its reverse (31042530101001), we get a palindrome (41052633625014).
The spelling of 10010103524013 in words is "ten trillion, ten billion, one hundred three million, five hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •