Base | Representation |
---|---|
bin | 100011110010111… |
… | …1000011111000110 |
3 | 10002201002212022210 |
4 | 1013211320133012 |
5 | 4424441104110 |
6 | 315104004250 |
7 | 41523202155 |
oct | 10745703706 |
9 | 3081085283 |
10 | 1201113030 |
11 | 566aa6aa7 |
12 | 296300686 |
13 | 161ac3c90 |
14 | b573d59c |
15 | 706aa520 |
hex | 479787c6 |
1201113030 has 64 divisors (see below), whose sum is σ = 3163043520. Its totient is φ = 290075136.
The previous prime is 1201112963. The next prime is 1201113031. The reversal of 1201113030 is 303111021.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1201112997 and 1201113015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201113031) 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 31 ways as a sum of consecutive naturals, for example, 8385 + ... + 49724.
It is an arithmetic number, because the mean of its divisors is an integer number (49422555).
Almost surely, 21201113030 is an apocalyptic number.
1201113030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1201113030 is an abundant number, since it is smaller than the sum of its proper divisors (1961930490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201113030 is a wasteful number, since it uses less digits than its factorization.
1201113030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58185.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1201113030 is about 34657.0776321374. The cubic root of 1201113030 is about 1062.9870151194.
Adding to 1201113030 its reverse (303111021), we get a palindrome (1504224051).
The spelling of 1201113030 in words is "one billion, two hundred one million, one hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •