Base | Representation |
---|---|
bin | 10011011110011000… |
… | …01100100111010001 |
3 | 222222122200111112201 |
4 | 21233030030213101 |
5 | 132403040343321 |
6 | 4445251323201 |
7 | 520044313243 |
oct | 115714144721 |
9 | 28878614481 |
10 | 10455402961 |
11 | 4485890aa3 |
12 | 20395b0501 |
13 | ca8159493 |
14 | 71282a093 |
15 | 412d67291 |
hex | 26f30c9d1 |
10455402961 has 8 divisors (see below), whose sum is σ = 10504728000. Its totient is φ = 10406155920.
The previous prime is 10455402943. The next prime is 10455402977. The reversal of 10455402961 is 16920455401.
10455402961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10455402961 - 229 = 9918532049 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10455402961.
It is not an unprimeable number, because it can be changed into a prime (10455402361) by changing a digit.
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, 258490 + ... + 296188.
It is an arithmetic number, because the mean of its divisors is an integer number (1313091000).
Almost surely, 210455402961 is an apocalyptic number.
It is an amenable number.
10455402961 is a deficient number, since it is larger than the sum of its proper divisors (49325039).
10455402961 is a wasteful number, since it uses less digits than its factorization.
10455402961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38999.
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 10455402961 in words is "ten billion, four hundred fifty-five million, four hundred two thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •