Base | Representation |
---|---|
bin | 1100100001001… |
… | …01111100001001 |
3 | 21022121012202102 |
4 | 12100211330021 |
5 | 203340404001 |
6 | 14230443145 |
7 | 2413411232 |
oct | 620457411 |
9 | 238535672 |
10 | 105013001 |
11 | 54305905 |
12 | 2b2034b5 |
13 | 189aa492 |
14 | dd38089 |
15 | 9344e6b |
hex | 6425f09 |
105013001 has 4 divisors (see below), whose sum is σ = 105035412. Its totient is φ = 104990592.
The previous prime is 105012991. The next prime is 105013039. The reversal of 105013001 is 100310501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100310501 = 547 ⋅183383.
It can be written as a sum of positive squares in 2 ways, for example, as 46566976 + 58446025 = 6824^2 + 7645^2 .
It is a cyclic number.
It is not a de Polignac number, because 105013001 - 26 = 105012937 is a prime.
It is a super-2 number, since 2×1050130012 = 22055460758052002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105013091) 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, 1196 + ... + 14541.
It is an arithmetic number, because the mean of its divisors is an integer number (26258853).
Almost surely, 2105013001 is an apocalyptic number.
It is an amenable number.
105013001 is a deficient number, since it is larger than the sum of its proper divisors (22411).
105013001 is an equidigital number, since it uses as much as digits as its factorization.
105013001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22410.
The product of its (nonzero) digits is 15, while the sum is 11.
The square root of 105013001 is about 10247.5851301660. The cubic root of 105013001 is about 471.7888685739.
Adding to 105013001 its reverse (100310501), we get a palindrome (205323502).
The spelling of 105013001 in words is "one hundred five million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •