Base | Representation |
---|---|
bin | 11000011100000100… |
… | …00000111011100100 |
3 | 1020212101011212010220 |
4 | 30032002000323210 |
5 | 203332244423022 |
6 | 10005525444340 |
7 | 643063542414 |
oct | 141602007344 |
9 | 36771155126 |
10 | 13120311012 |
11 | 5623089946 |
12 | 2661b706b0 |
13 | 13112a7353 |
14 | 8c6726644 |
15 | 51bcb985c |
hex | 30e080ee4 |
13120311012 has 24 divisors (see below), whose sum is σ = 30669037056. Its totient is φ = 4365583008.
The previous prime is 13120311007. The next prime is 13120311031. The reversal of 13120311012 is 21011302131.
It is a happy number.
It is a super-2 number, since 2×131203110122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13120310982 and 13120311000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 974788 + ... + 988155.
It is an arithmetic number, because the mean of its divisors is an integer number (1277876544).
Almost surely, 213120311012 is an apocalyptic number.
13120311012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13120311012 is an abundant number, since it is smaller than the sum of its proper divisors (17548726044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13120311012 is a wasteful number, since it uses less digits than its factorization.
13120311012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1963507 (or 1963505 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13120311012 its reverse (21011302131), we get a palindrome (34131613143).
The spelling of 13120311012 in words is "thirteen billion, one hundred twenty million, three hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •