Base | Representation |
---|---|
bin | 1001011101001000100111… |
… | …1010010000000000000001 |
3 | 1100210212020111101012110001 |
4 | 2113102021322100000001 |
5 | 2330312240424323201 |
6 | 34035530204240001 |
7 | 2122044623051461 |
oct | 227221172200001 |
9 | 40725214335401 |
10 | 10396134604801 |
11 | 3348a80a59830 |
12 | 11baa10540001 |
13 | 5a5474a1386a |
14 | 27d265bb9ba1 |
15 | 130662304301 |
hex | 97489e90001 |
10396134604801 has 16 divisors (see below), whose sum is σ = 11374333970688. Its totient is φ = 9423482662800.
The previous prime is 10396134604759. The next prime is 10396134604811. The reversal of 10396134604801 is 10840643169301.
It is a cyclic number.
It is not a de Polignac number, because 10396134604801 - 223 = 10396126216193 is a prime.
It is a super-4 number, since 4×103961346048014 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10396134604811) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5848066 + ... + 7415668.
It is an arithmetic number, because the mean of its divisors is an integer number (710895873168).
Almost surely, 210396134604801 is an apocalyptic number.
10396134604801 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10396134604801 is a deficient number, since it is larger than the sum of its proper divisors (978199365887).
10396134604801 is a wasteful number, since it uses less digits than its factorization.
10396134604801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1569372.
The product of its (nonzero) digits is 373248, while the sum is 46.
The spelling of 10396134604801 in words is "ten trillion, three hundred ninety-six billion, one hundred thirty-four million, six hundred four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •