Base | Representation |
---|---|
bin | 111100011000101… |
… | …101110011001100 |
3 | 2121121100102102010 |
4 | 330120231303030 |
5 | 4033324041022 |
6 | 244310301220 |
7 | 34051211223 |
oct | 7430556314 |
9 | 2547312363 |
10 | 1013112012 |
11 | 47a96a060 |
12 | 243357810 |
13 | 131b7b383 |
14 | 987a1cba |
15 | 5de2150c |
hex | 3c62dccc |
1013112012 has 48 divisors (see below), whose sum is σ = 2604397824. Its totient is φ = 303960000.
The previous prime is 1013112011. The next prime is 1013112041. The reversal of 1013112012 is 2102113101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (1013112011) 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, 24664 + ... + 51327.
It is an arithmetic number, because the mean of its divisors is an integer number (54258288).
Almost surely, 21013112012 is an apocalyptic number.
1013112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1013112012 is an abundant number, since it is smaller than the sum of its proper divisors (1591285812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013112012 is a wasteful number, since it uses less digits than its factorization.
1013112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76110 (or 76108 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1013112012 is about 31829.4205413796. The cubic root of 1013112012 is about 1004.3517058529.
Adding to 1013112012 its reverse (2102113101), we get a palindrome (3115225113).
It can be divided in two parts, 101 and 3112012, that added together give a palindrome (3112113).
The spelling of 1013112012 in words is "one billion, thirteen million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •