Base | Representation |
---|---|
bin | 10111110101011101… |
… | …01100101000000010 |
3 | 1020000210211112111210 |
4 | 23322232230220002 |
5 | 202201344330002 |
6 | 5513440550550 |
7 | 632052166605 |
oct | 137256545002 |
9 | 36023745453 |
10 | 12796480002 |
11 | 5477308909 |
12 | 2591622456 |
13 | 128c184477 |
14 | 89570c33c |
15 | 4ed64e96c |
hex | 2fabaca02 |
12796480002 has 8 divisors (see below), whose sum is σ = 25592960016. Its totient is φ = 4265493332.
The previous prime is 12796480001. The next prime is 12796480003. The reversal of 12796480002 is 20008469721.
12796480002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12796480001) and next prime (12796480003).
It is a sphenic number, since it is the product of 3 distinct primes.
12796480002 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (12796480001) 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 3 ways as a sum of consecutive naturals, for example, 1066373328 + ... + 1066373339.
It is an arithmetic number, because the mean of its divisors is an integer number (3199120002).
Almost surely, 212796480002 is an apocalyptic number.
12796480002 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.
12796480002 is a wasteful number, since it uses less digits than its factorization.
12796480002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2132746672.
The product of its (nonzero) digits is 48384, while the sum is 39.
The spelling of 12796480002 in words is "twelve billion, seven hundred ninety-six million, four hundred eighty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •