Base | Representation |
---|---|
bin | 110000111111001111… |
… | …0000100000000100101 |
3 | 101001112122021210100112 |
4 | 1201332132010000211 |
5 | 3210422430300221 |
6 | 120154555022405 |
7 | 10412656646606 |
oct | 1417636040045 |
9 | 331478253315 |
10 | 105201025061 |
11 | 40685266220 |
12 | 1847b73aa05 |
13 | 9bc71c4072 |
14 | 513dacddad |
15 | 2b0ab4e15b |
hex | 187e784025 |
105201025061 has 8 divisors (see below), whose sum is σ = 114773260800. Its totient is φ = 95630207040.
The previous prime is 105201025057. The next prime is 105201025091. The reversal of 105201025061 is 160520102501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105201025061 - 22 = 105201025057 is a prime.
It is a super-2 number, since 2×1052010250612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105201025091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 196196 + ... + 498893.
It is an arithmetic number, because the mean of its divisors is an integer number (14346657600).
Almost surely, 2105201025061 is an apocalyptic number.
105201025061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105201025061 is a deficient number, since it is larger than the sum of its proper divisors (9572235739).
105201025061 is a wasteful number, since it uses less digits than its factorization.
105201025061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 708859.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 105201025061 its reverse (160520102501), we get a palindrome (265721127562).
The spelling of 105201025061 in words is "one hundred five billion, two hundred one million, twenty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •