Base | Representation |
---|---|
bin | 10011011000010000… |
… | …00111000100000001 |
3 | 222212001221221221101 |
4 | 21230020013010001 |
5 | 132301411000001 |
6 | 4440213454401 |
7 | 515551353343 |
oct | 115410070401 |
9 | 28761857841 |
10 | 10404000001 |
11 | 445987220a |
12 | 2024341401 |
13 | c9a5cc625 |
14 | 709a89293 |
15 | 40d5b1a01 |
hex | 26c207101 |
10404000001 has 8 divisors (see below), whose sum is σ = 10521901800. Its totient is φ = 10286390400.
The previous prime is 10403999989. The next prime is 10404000049. The reversal of 10404000001 is 10000040401.
It is a Cunningham number, because it is equal to 1020002+1.
It can be written as a sum of positive squares in 4 ways, for example, as 313998400 + 10090001601 = 17720^2 + 100449^2 .
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 10404000001 - 231 = 8256516353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10404000091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1036 + ... + 144253.
It is an arithmetic number, because the mean of its divisors is an integer number (1315237725).
Almost surely, 210404000001 is an apocalyptic number.
It is an amenable number.
10404000001 is a deficient number, since it is larger than the sum of its proper divisors (117901799).
10404000001 is a wasteful number, since it uses less digits than its factorization.
10404000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146099.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10404000001 its reverse (10000040401), we get a palindrome (20404040402).
The spelling of 10404000001 in words is "ten billion, four hundred four million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •