Base | Representation |
---|---|
bin | 1001000110010101110000… |
… | …1011110011100110100001 |
3 | 1022102102102120121222101101 |
4 | 2101211130023303212201 |
5 | 2302403232002244301 |
6 | 33140003204434401 |
7 | 2051542316024260 |
oct | 221453413634641 |
9 | 38372376558341 |
10 | 10004525431201 |
11 | 3207993874504 |
12 | 1156b3b3a8a01 |
13 | 577565897572 |
14 | 2683161785d7 |
15 | 1253923a6701 |
hex | 9195c2f39a1 |
10004525431201 has 8 divisors (see below), whose sum is σ = 12106316488320. Its totient is φ = 8070877658688.
The previous prime is 10004525431193. The next prime is 10004525431207. The reversal of 10004525431201 is 10213452540001.
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 10004525431201 - 23 = 10004525431193 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10004525431201.
It is not an unprimeable number, because it can be changed into a prime (10004525431207) 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, 42035821021 + ... + 42035821258.
It is an arithmetic number, because the mean of its divisors is an integer number (1513289561040).
Almost surely, 210004525431201 is an apocalyptic number.
It is an amenable number.
10004525431201 is a deficient number, since it is larger than the sum of its proper divisors (2101791057119).
10004525431201 is an equidigital number, since it uses as much as digits as its factorization.
10004525431201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84071642303.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 10004525431201 its reverse (10213452540001), we get a palindrome (20217977971202).
The spelling of 10004525431201 in words is "ten trillion, four billion, five hundred twenty-five million, four hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •