Base | Representation |
---|---|
bin | 10011001011011110… |
… | …11001001101101001 |
3 | 222120121100112222201 |
4 | 21211233121031221 |
5 | 132041443414244 |
6 | 4421425220201 |
7 | 513110562364 |
oct | 114557311551 |
9 | 28517315881 |
10 | 10296857449 |
11 | 440434244a |
12 | 1bb4491661 |
13 | c81357a78 |
14 | 6d97590db |
15 | 403e9aad4 |
hex | 265bd9369 |
10296857449 has 8 divisors (see below), whose sum is σ = 10959048360. Its totient is φ = 9640943616.
The previous prime is 10296857423. The next prime is 10296857489. The reversal of 10296857449 is 94475869201.
It can be written as a sum of positive squares in 4 ways, for example, as 4393701225 + 5903156224 = 66285^2 + 76832^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 10296857449 - 221 = 10294760297 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 10296857449.
It is not an unprimeable number, because it can be changed into a prime (10296857489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1565884 + ... + 1572445.
It is an arithmetic number, because the mean of its divisors is an integer number (1369881045).
Almost surely, 210296857449 is an apocalyptic number.
It is an amenable number.
10296857449 is a deficient number, since it is larger than the sum of its proper divisors (662190911).
10296857449 is a wasteful number, since it uses less digits than its factorization.
10296857449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3138539.
The product of its (nonzero) digits is 4354560, while the sum is 55.
The spelling of 10296857449 in words is "ten billion, two hundred ninety-six million, eight hundred fifty-seven thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •