Base | Representation |
---|---|
bin | 111100011000101… |
… | …110000010110110 |
3 | 2121121100110210020 |
4 | 330120232002312 |
5 | 4033324104024 |
6 | 244310310010 |
7 | 34051214154 |
oct | 7430560266 |
9 | 2547313706 |
10 | 1013113014 |
11 | 47a96a891 |
12 | 243358306 |
13 | 131b7b974 |
14 | 987a23d4 |
15 | 5de21979 |
hex | 3c62e0b6 |
1013113014 has 8 divisors (see below), whose sum is σ = 2026226040. Its totient is φ = 337704336.
The previous prime is 1013113009. The next prime is 1013113027. The reversal of 1013113014 is 4103113101.
1013113014 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
1013113014 is an admirable number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1013112984 and 1013113002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84426079 + ... + 84426090.
It is an arithmetic number, because the mean of its divisors is an integer number (253278255).
Almost surely, 21013113014 is an apocalyptic number.
1013113014 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013113014 is a wasteful number, since it uses less digits than its factorization.
1013113014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168852174.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1013113014 is about 31829.4362815303. The cubic root of 1013113014 is about 1004.3520369647.
Adding to 1013113014 its reverse (4103113101), we get a palindrome (5116226115).
The spelling of 1013113014 in words is "one billion, thirteen million, one hundred thirteen thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •