Base | Representation |
---|---|
bin | 100011110010111… |
… | …0111101111111100 |
3 | 10002201002201012000 |
4 | 1013211313233330 |
5 | 4424441010022 |
6 | 315103542300 |
7 | 41523160314 |
oct | 10745675774 |
9 | 3081081160 |
10 | 1201110012 |
11 | 566aa4803 |
12 | 2962ba990 |
13 | 161ac27ab |
14 | b573c444 |
15 | 706a96ac |
hex | 47977bfc |
1201110012 has 24 divisors (see below), whose sum is σ = 3113989200. Its totient is φ = 400369968.
The previous prime is 1201110007. The next prime is 1201110037. The reversal of 1201110012 is 2100111021.
It is a happy number.
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 = 1201109976 and 1201110003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5560587 + ... + 5560802.
It is an arithmetic number, because the mean of its divisors is an integer number (129749550).
Almost surely, 21201110012 is an apocalyptic number.
1201110012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1201110012 is an abundant number, since it is smaller than the sum of its proper divisors (1912879188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201110012 is a wasteful number, since it uses less digits than its factorization.
1201110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11121402 (or 11121394 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1201110012 is about 34657.0340912202. The cubic root of 1201110012 is about 1062.9861248070.
Adding to 1201110012 its reverse (2100111021), we get a palindrome (3301221033).
The spelling of 1201110012 in words is "one billion, two hundred one million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •