Base | Representation |
---|---|
bin | 10011011000011111… |
… | …10000010110110001 |
3 | 222212012201210002221 |
4 | 21230033300112301 |
5 | 132302414113040 |
6 | 4440324441041 |
7 | 515604401335 |
oct | 115417602661 |
9 | 28765653087 |
10 | 10406004145 |
11 | 445aa10a29 |
12 | 2024b49181 |
13 | c9ab51904 |
14 | 70a04b7c5 |
15 | 40d85a74a |
hex | 26c3f05b1 |
10406004145 has 4 divisors (see below), whose sum is σ = 12487204980. Its totient is φ = 8324803312.
The previous prime is 10406004101. The next prime is 10406004179. The reversal of 10406004145 is 54140060401.
10406004145 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 6590841856 + 3815162289 = 81184^2 + 61767^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10406004145 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1040600410 + ... + 1040600419.
It is an arithmetic number, because the mean of its divisors is an integer number (3121801245).
Almost surely, 210406004145 is an apocalyptic number.
It is an amenable number.
10406004145 is a deficient number, since it is larger than the sum of its proper divisors (2081200835).
10406004145 is an equidigital number, since it uses as much as digits as its factorization.
10406004145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2081200834.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 10406004145 its reverse (54140060401), we get a palindrome (64546064546).
The spelling of 10406004145 in words is "ten billion, four hundred six million, four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •