Base | Representation |
---|---|
bin | 110001000100000110… |
… | …1001000100110010010 |
3 | 101001222000122001011210 |
4 | 1202020031020212102 |
5 | 3211241234001240 |
6 | 120223111520550 |
7 | 10420012164531 |
oct | 1421015104622 |
9 | 331860561153 |
10 | 105364359570 |
11 | 40759485918 |
12 | 18506389156 |
13 | 9c21cb14c2 |
14 | 515768a318 |
15 | 2b1a164780 |
hex | 1888348992 |
105364359570 has 16 divisors (see below), whose sum is σ = 252874463040. Its totient is φ = 28097162544.
The previous prime is 105364359559. The next prime is 105364359623. The reversal of 105364359570 is 75953463501.
It is a super-2 number, since 2×1053643595702 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1756072630 + ... + 1756072689.
It is an arithmetic number, because the mean of its divisors is an integer number (15804653940).
Almost surely, 2105364359570 is an apocalyptic number.
105364359570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105364359570 is an abundant number, since it is smaller than the sum of its proper divisors (147510103470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105364359570 is a wasteful number, since it uses less digits than its factorization.
105364359570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3512145329.
The product of its (nonzero) digits is 1701000, while the sum is 48.
The spelling of 105364359570 in words is "one hundred five billion, three hundred sixty-four million, three hundred fifty-nine thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •