Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1100011011111010100001 |
3 | 1022102000000012112112202202 |
4 | 2101201110130123322201 |
5 | 2302320201223334401 |
6 | 33133552141222545 |
7 | 2051324546441141 |
oct | 221412434337241 |
9 | 38360005475682 |
10 | 10000100605601 |
11 | 32060230a9547 |
12 | 1156105561a55 |
13 | 57700bc51872 |
14 | 26801663a921 |
15 | 1251d3bb706b |
hex | 9185471bea1 |
10000100605601 has 4 divisors (see below), whose sum is σ = 10000639974804. Its totient is φ = 9999561236400.
The previous prime is 10000100605589. The next prime is 10000100605609. The reversal of 10000100605601 is 10650600100001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1476030606400 + 8524069999201 = 1214920^2 + 2919601^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000100605601 - 210 = 10000100604577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10000100605609) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 269656790 + ... + 269693871.
It is an arithmetic number, because the mean of its divisors is an integer number (2500159993701).
Almost surely, 210000100605601 is an apocalyptic number.
It is an amenable number.
10000100605601 is a deficient number, since it is larger than the sum of its proper divisors (539369203).
10000100605601 is an equidigital number, since it uses as much as digits as its factorization.
10000100605601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 539369202.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 10000100605601 its reverse (10650600100001), we get a palindrome (20650700705602).
The spelling of 10000100605601 in words is "ten trillion, one hundred million, six hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •