Base | Representation |
---|---|
bin | 110001000100010000… |
… | …1010101111001111001 |
3 | 101001222101121011211011 |
4 | 1202020201111321321 |
5 | 3211244113010303 |
6 | 120223421233521 |
7 | 10420105210021 |
oct | 1421041257171 |
9 | 331871534734 |
10 | 105369656953 |
11 | 40761473920 |
12 | 185081028a1 |
13 | 9c23117752 |
14 | 5158268a81 |
15 | 2b1a85e16d |
hex | 1888855e79 |
105369656953 has 16 divisors (see below), whose sum is σ = 117998415360. Its totient is φ = 93258947200.
The previous prime is 105369656947. The next prime is 105369656969. The reversal of 105369656953 is 359656963501.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105369656953 is a prime.
It is a super-2 number, since 2×1053696569532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105369656993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27850 + ... + 459907.
It is an arithmetic number, because the mean of its divisors is an integer number (7374900960).
Almost surely, 2105369656953 is an apocalyptic number.
It is an amenable number.
105369656953 is a deficient number, since it is larger than the sum of its proper divisors (12628758407).
105369656953 is a wasteful number, since it uses less digits than its factorization.
105369656953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488288.
The product of its (nonzero) digits is 19683000, while the sum is 58.
The spelling of 105369656953 in words is "one hundred five billion, three hundred sixty-nine million, six hundred fifty-six thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •