Base | Representation |
---|---|
bin | 10011011001000111… |
… | …11101110100000001 |
3 | 222212120200221121011 |
4 | 21230203331310001 |
5 | 132310243132040 |
6 | 4441034200521 |
7 | 516000415366 |
oct | 115443756401 |
9 | 28776627534 |
10 | 10411302145 |
11 | 44629aa442 |
12 | 2026883141 |
13 | c9bc8821a |
14 | 70aa2a46d |
15 | 40e0553ea |
hex | 26c8fdd01 |
10411302145 has 8 divisors (see below), whose sum is σ = 12508785000. Its totient is φ = 8318893440.
The previous prime is 10411302133. The next prime is 10411302169. The reversal of 10411302145 is 54120311401.
10411302145 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1030217409 + 9381084736 = 32097^2 + 96856^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10411302145 - 25 = 10411302113 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 7 ways as a sum of consecutive naturals, for example, 1264020 + ... + 1272229.
It is an arithmetic number, because the mean of its divisors is an integer number (1563598125).
Almost surely, 210411302145 is an apocalyptic number.
It is an amenable number.
10411302145 is a deficient number, since it is larger than the sum of its proper divisors (2097482855).
10411302145 is an equidigital number, since it uses as much as digits as its factorization.
10411302145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2537075.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 10411302145 its reverse (54120311401), we get a palindrome (64531613546).
The spelling of 10411302145 in words is "ten billion, four hundred eleven million, three hundred two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •