Base | Representation |
---|---|
bin | 10111010001010101… |
… | …10111010010010001 |
3 | 1012020200200210210010 |
4 | 23220222313102101 |
5 | 201041313011301 |
6 | 5423414425133 |
7 | 621412605051 |
oct | 135052672221 |
9 | 35220623703 |
10 | 12493485201 |
11 | 533127938a |
12 | 25080621a9 |
13 | 12414784c2 |
14 | 867399561 |
15 | 4d1c4d5d6 |
hex | 2e8ab7491 |
12493485201 has 8 divisors (see below), whose sum is σ = 16666806240. Its totient is φ = 8324577152.
The previous prime is 12493485197. The next prime is 12493485203. The reversal of 12493485201 is 10258439421.
12493485201 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.
It is a cyclic number.
It is not a de Polignac number, because 12493485201 - 22 = 12493485197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12493485201.
It is not an unprimeable number, because it can be changed into a prime (12493485203) 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 7 ways as a sum of consecutive naturals, for example, 1096635 + ... + 1107968.
It is an arithmetic number, because the mean of its divisors is an integer number (2083350780).
Almost surely, 212493485201 is an apocalyptic number.
It is an amenable number.
12493485201 is a deficient number, since it is larger than the sum of its proper divisors (4173321039).
12493485201 is a wasteful number, since it uses less digits than its factorization.
12493485201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2206495.
The product of its (nonzero) digits is 69120, while the sum is 39.
The spelling of 12493485201 in words is "twelve billion, four hundred ninety-three million, four hundred eighty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •