Base | Representation |
---|---|
bin | 10011001101100010101… |
… | …01010101100110011100 |
3 | 2100002211212022101112220 |
4 | 21212301111111212130 |
5 | 41303343410011040 |
6 | 1223125332225340 |
7 | 65456010153651 |
oct | 11466125254634 |
9 | 2302755271486 |
10 | 660105157020 |
11 | 234a49174691 |
12 | a7b23a6b250 |
13 | 4a32b11558a |
14 | 23d40aabc28 |
15 | 122869432d0 |
hex | 99b155599c |
660105157020 has 48 divisors (see below), whose sum is σ = 1855322219520. Its totient is φ = 175358729536.
The previous prime is 660105156983. The next prime is 660105157027. The reversal of 660105157020 is 20751501066.
660105157020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (660105157027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20900100 + ... + 20931659.
It is an arithmetic number, because the mean of its divisors is an integer number (38652546240).
Almost surely, 2660105157020 is an apocalyptic number.
660105157020 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
660105157020 is an abundant number, since it is smaller than the sum of its proper divisors (1195217062500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
660105157020 is a wasteful number, since it uses less digits than its factorization.
660105157020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41832034 (or 41832032 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
Adding to 660105157020 its reverse (20751501066), we get a palindrome (680856658086).
The spelling of 660105157020 in words is "six hundred sixty billion, one hundred five million, one hundred fifty-seven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •