Base | Representation |
---|---|
bin | 101001011101… |
… | …010101010011 |
3 | 202110011011102 |
4 | 221131111103 |
5 | 10240234201 |
6 | 1024535015 |
7 | 161243165 |
oct | 51352523 |
9 | 22404142 |
10 | 10868051 |
11 | 6153367 |
12 | 378146b |
13 | 23369cc |
14 | 162c935 |
15 | e4a26b |
hex | a5d553 |
10868051 has 4 divisors (see below), whose sum is σ = 10878504. Its totient is φ = 10857600.
The previous prime is 10868027. The next prime is 10868059. The reversal of 10868051 is 15086801.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 15086801 = 31 ⋅486671.
It is a cyclic number.
It is not a de Polignac number, because 10868051 - 214 = 10851667 is a prime.
It is a super-2 number, since 2×108680512 = 236229065077202, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 13.
It is not an unprimeable number, because it can be changed into a prime (10868059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3470 + ... + 5811.
It is an arithmetic number, because the mean of its divisors is an integer number (2719626).
Almost surely, 210868051 is an apocalyptic number.
10868051 is a deficient number, since it is larger than the sum of its proper divisors (10453).
10868051 is an equidigital number, since it uses as much as digits as its factorization.
10868051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10452.
The product of its (nonzero) digits is 1920, while the sum is 29.
The square root of 10868051 is about 3296.6727165432. The cubic root of 10868051 is about 221.5051812216.
The spelling of 10868051 in words is "ten million, eight hundred sixty-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •