Base | Representation |
---|---|
bin | 100011110010101… |
… | …1111010101100100 |
3 | 10002200220122000121 |
4 | 1013211133111210 |
5 | 4424424310040 |
6 | 315101451324 |
7 | 41522262640 |
oct | 10745372544 |
9 | 3080818017 |
10 | 1201010020 |
11 | 566a36671 |
12 | 296270b44 |
13 | 161a89122 |
14 | b5713c20 |
15 | 70689c4a |
hex | 4795f564 |
1201010020 has 48 divisors (see below), whose sum is σ = 2884654080. Its totient is φ = 411456384.
The previous prime is 1201010009. The next prime is 1201010093. The reversal of 1201010020 is 200101021.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 1201009985 and 1201010012.
It is an unprimeable number.
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, 243822 + ... + 248698.
It is an arithmetic number, because the mean of its divisors is an integer number (60096960).
Almost surely, 21201010020 is an apocalyptic number.
1201010020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1201010020 is an abundant number, since it is smaller than the sum of its proper divisors (1683644060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201010020 is a wasteful number, since it uses less digits than its factorization.
1201010020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6652 (or 6650 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
The square root of 1201010020 is about 34655.5914680445. The cubic root of 1201010020 is about 1062.9566262439.
Adding to 1201010020 its reverse (200101021), we get a palindrome (1401111041).
The spelling of 1201010020 in words is "one billion, two hundred one million, ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •