Base | Representation |
---|---|
bin | 101000001011… |
… | …110011001111 |
3 | 201211012001200 |
4 | 220023303033 |
5 | 10144042340 |
6 | 1013440543 |
7 | 155352435 |
oct | 50136317 |
9 | 21735050 |
10 | 10534095 |
11 | 5a45470 |
12 | 3640153 |
13 | 224a9c0 |
14 | 1582d55 |
15 | dd1330 |
hex | a0bccf |
10534095 has 48 divisors (see below), whose sum is σ = 21464352. Its totient is φ = 4711680.
The previous prime is 10534093. The next prime is 10534127. The reversal of 10534095 is 59043501.
It is not a de Polignac number, because 10534095 - 21 = 10534093 is a prime.
It is a super-2 number, since 2×105340952 = 221934314938050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10534093) 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 47 ways as a sum of consecutive naturals, for example, 5617 + ... + 7253.
It is an arithmetic number, because the mean of its divisors is an integer number (447174).
Almost surely, 210534095 is an apocalyptic number.
10534095 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10534095 is an abundant number, since it is smaller than the sum of its proper divisors (10930257).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10534095 is a wasteful number, since it uses less digits than its factorization.
10534095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1672 (or 1669 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 10534095 is about 3245.6270580583. The cubic root of 10534095 is about 219.2127163201.
Adding to 10534095 its reverse (59043501), we get a palindrome (69577596).
The spelling of 10534095 in words is "ten million, five hundred thirty-four thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •