Base | Representation |
---|---|
bin | 10011100111110100… |
… | …01011100010011101 |
3 | 1000012011122101212210 |
4 | 21303322023202131 |
5 | 133033322103140 |
6 | 4501200151033 |
7 | 522025222353 |
oct | 116372134235 |
9 | 30164571783 |
10 | 10534566045 |
11 | 4516540433 |
12 | 2060008479 |
13 | cbb685943 |
14 | 71d1557d3 |
15 | 419ca2d80 |
hex | 273e8b89d |
10534566045 has 16 divisors (see below), whose sum is σ = 16914871872. Its totient is φ = 5598579840.
The previous prime is 10534566011. The next prime is 10534566061. The reversal of 10534566045 is 54066543501.
It is not a de Polignac number, because 10534566045 - 29 = 10534565533 is a prime.
It is a super-2 number, since 2×105345660452 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10534565994 and 10534566012.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1236576 + ... + 1245065.
It is an arithmetic number, because the mean of its divisors is an integer number (1057179492).
Almost surely, 210534566045 is an apocalyptic number.
10534566045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10534566045 is a deficient number, since it is larger than the sum of its proper divisors (6380305827).
10534566045 is a wasteful number, since it uses less digits than its factorization.
10534566045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2481932.
The product of its (nonzero) digits is 216000, while the sum is 39.
It can be divided in two parts, 1053456 and 6045, that added together give a palindrome (1059501).
The spelling of 10534566045 in words is "ten billion, five hundred thirty-four million, five hundred sixty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •