Base | Representation |
---|---|
bin | 100110100110… |
… | …111110111001 |
3 | 201001012121020 |
4 | 212212332321 |
5 | 10042334040 |
6 | 1000533053 |
7 | 152012466 |
oct | 46467671 |
9 | 21035536 |
10 | 10121145 |
11 | 5793191 |
12 | 3481189 |
13 | 2134a58 |
14 | 14b666d |
15 | d4dcd0 |
hex | 9a6fb9 |
10121145 has 32 divisors (see below), whose sum is σ = 17107200. Its totient is φ = 5101824.
The previous prime is 10121143. The next prime is 10121147. The reversal of 10121145 is 54112101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10121143) and next prime (10121147).
It is not a de Polignac number, because 10121145 - 21 = 10121143 is a prime.
It is a super-2 number, since 2×101211452 = 204875152222050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (10121143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22836 + ... + 23274.
It is an arithmetic number, because the mean of its divisors is an integer number (534600).
Almost surely, 210121145 is an apocalyptic number.
10121145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10121145 is a deficient number, since it is larger than the sum of its proper divisors (6986055).
10121145 is a wasteful number, since it uses less digits than its factorization.
10121145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529.
The product of its (nonzero) digits is 40, while the sum is 15.
The square root of 10121145 is about 3181.3747028604. The cubic root of 10121145 is about 216.3099759023.
Adding to 10121145 its reverse (54112101), we get a palindrome (64233246).
The spelling of 10121145 in words is "ten million, one hundred twenty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •