Base | Representation |
---|---|
bin | 110000111011011001… |
… | …0101100010000010101 |
3 | 101001012122220120020210 |
4 | 1201312302230100111 |
5 | 3210141441340221 |
6 | 120134114120033 |
7 | 10406534043342 |
oct | 1416662542025 |
9 | 331178816223 |
10 | 105072215061 |
11 | 40619587380 |
12 | 18444580019 |
13 | 9ba6604128 |
14 | 512a95d7c9 |
15 | 2aee6a8276 |
hex | 1876cac415 |
105072215061 has 64 divisors (see below), whose sum is σ = 164129587200. Its totient is φ = 59084928000.
The previous prime is 105072215057. The next prime is 105072215093. The reversal of 105072215061 is 160512270501.
It is not a de Polignac number, because 105072215061 - 22 = 105072215057 is a prime.
It is a super-2 number, since 2×1050722150612 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105072213061) 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 63 ways as a sum of consecutive naturals, for example, 13538100 + ... + 13545858.
It is an arithmetic number, because the mean of its divisors is an integer number (2564524800).
Almost surely, 2105072215061 is an apocalyptic number.
105072215061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105072215061 is a deficient number, since it is larger than the sum of its proper divisors (59057372139).
105072215061 is a wasteful number, since it uses less digits than its factorization.
105072215061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8130.
The product of its (nonzero) digits is 4200, while the sum is 30.
Adding to 105072215061 its reverse (160512270501), we get a palindrome (265584485562).
The spelling of 105072215061 in words is "one hundred five billion, seventy-two million, two hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •