Base | Representation |
---|---|
bin | 1001011101100110011100… |
… | …0100110101000010110001 |
3 | 1100211121220102011000001122 |
4 | 2113121213010311002301 |
5 | 2330430134332010001 |
6 | 34043332422112025 |
7 | 2122450201531001 |
oct | 227314704650261 |
9 | 40747812130048 |
10 | 10404140110001 |
11 | 3351409947330 |
12 | 120048557b615 |
13 | 5a614c4336a1 |
14 | 27d7c50b8001 |
15 | 13098003ab1b |
hex | 976671350b1 |
10404140110001 has 16 divisors (see below), whose sum is σ = 12359315102400. Its totient is φ = 8651520561600.
The previous prime is 10404140109991. The next prime is 10404140110003. The reversal of 10404140110001 is 10001104140401.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10404140110001 is a prime.
It is a super-2 number, since 2×104041401100012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10404140110003) 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, 858279710 + ... + 858291831.
It is an arithmetic number, because the mean of its divisors is an integer number (772457193900).
Almost surely, 210404140110001 is an apocalyptic number.
10404140110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10404140110001 is a deficient number, since it is larger than the sum of its proper divisors (1955174992399).
10404140110001 is a wasteful number, since it uses less digits than its factorization.
10404140110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1716571600.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10404140110001 its reverse (10001104140401), we get a palindrome (20405244250402).
The spelling of 10404140110001 in words is "ten trillion, four hundred four billion, one hundred forty million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •