Base | Representation |
---|---|
bin | 10011100111110101… |
… | …00000111110110001 |
3 | 1000012011210212100200 |
4 | 21303322200332301 |
5 | 133033332410443 |
6 | 4501202105413 |
7 | 522026036412 |
oct | 116372407661 |
9 | 30164725320 |
10 | 10534653873 |
11 | 45165a0417 |
12 | 206004b269 |
13 | cbb6b6903 |
14 | 71d179809 |
15 | 419cbddd3 |
hex | 273ea0fb1 |
10534653873 has 12 divisors (see below), whose sum is σ = 16017602640. Its totient is φ = 6653465496.
The previous prime is 10534653853. The next prime is 10534653881. The reversal of 10534653873 is 37835643501.
10534653873 is a `hidden beast` number, since 1 + 0 + 5 + 3 + 46 + 538 + 73 = 666.
It is not a de Polignac number, because 10534653873 - 28 = 10534653617 is a prime.
It is a super-2 number, since 2×105346538732 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (10534653853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30802911 + ... + 30803252.
It is an arithmetic number, because the mean of its divisors is an integer number (1334800220).
Almost surely, 210534653873 is an apocalyptic number.
It is an amenable number.
10534653873 is a deficient number, since it is larger than the sum of its proper divisors (5482948767).
10534653873 is a wasteful number, since it uses less digits than its factorization.
10534653873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61606188 (or 61606185 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 45.
The spelling of 10534653873 in words is "ten billion, five hundred thirty-four million, six hundred fifty-three thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •