Base | Representation |
---|---|
bin | 100011110010110… |
… | …0000000100010010 |
3 | 10002200220210010100 |
4 | 1013211200010102 |
5 | 4424424404020 |
6 | 315101513230 |
7 | 41522304441 |
oct | 10745400422 |
9 | 3080823110 |
10 | 1201013010 |
11 | 566a3893a |
12 | 296272816 |
13 | 161a8a5b2 |
14 | b5714d58 |
15 | 7068aa90 |
hex | 47960112 |
1201013010 has 48 divisors (see below), whose sum is σ = 3143626200. Its totient is φ = 318117120.
The previous prime is 1201012997. The next prime is 1201013029. The reversal of 1201013010 is 103101021.
It can be written as a sum of positive squares in 4 ways, for example, as 542936601 + 658076409 = 23301^2 + 25653^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1201012983 and 1201013001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31371 + ... + 58190.
Almost surely, 21201013010 is an apocalyptic number.
1201013010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1201013010 is an abundant number, since it is smaller than the sum of its proper divisors (1942613190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201013010 is a wasteful number, since it uses less digits than its factorization.
1201013010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89723 (or 89720 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1201013010 is about 34655.6346067995. The cubic root of 1201013010 is about 1062.9575083453.
Adding to 1201013010 its reverse (103101021), we get a palindrome (1304114031).
The spelling of 1201013010 in words is "one billion, two hundred one million, thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •