Base | Representation |
---|---|
bin | 100111000111… |
… | …101100010001 |
3 | 201022000101022 |
4 | 213013230101 |
5 | 10111130441 |
6 | 1003445225 |
7 | 153111212 |
oct | 47075421 |
9 | 21260338 |
10 | 10255121 |
11 | 5874908 |
12 | 3526815 |
13 | 2180a26 |
14 | 150d409 |
15 | d7884b |
hex | 9c7b11 |
10255121 has 4 divisors (see below), whose sum is σ = 10267200. Its totient is φ = 10243044.
The previous prime is 10255109. The next prime is 10255151. The reversal of 10255121 is 12155201.
10255121 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, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12155201 = 23 ⋅528487.
It is a cyclic number.
It is not a de Polignac number, because 10255121 - 26 = 10255057 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 10255121.
It is not an unprimeable number, because it can be changed into a prime (10255151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4661 + ... + 6498.
It is an arithmetic number, because the mean of its divisors is an integer number (2566800).
Almost surely, 210255121 is an apocalyptic number.
It is an amenable number.
10255121 is a deficient number, since it is larger than the sum of its proper divisors (12079).
10255121 is an equidigital number, since it uses as much as digits as its factorization.
10255121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12078.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 10255121 is about 3202.3617846833. The cubic root of 10255121 is about 217.2602440211.
The spelling of 10255121 in words is "ten million, two hundred fifty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •