Base | Representation |
---|---|
bin | 10111010000011001… |
… | …11100011001010101 |
3 | 1012020010221022200021 |
4 | 23220030330121111 |
5 | 201032311014223 |
6 | 5422534345141 |
7 | 621256130041 |
oct | 135014743125 |
9 | 35203838607 |
10 | 12485641813 |
11 | 5327901547 |
12 | 25054bb1b1 |
13 | 123c960448 |
14 | 866317021 |
15 | 4d11ee65d |
hex | 2e833c655 |
12485641813 has 2 divisors, whose sum is σ = 12485641814. Its totient is φ = 12485641812.
The previous prime is 12485641757. The next prime is 12485641837. The reversal of 12485641813 is 31814658421.
12485641813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11894519844 + 591121969 = 109062^2 + 24313^2 .
It is a cyclic number.
It is not a de Polignac number, because 12485641813 - 225 = 12452087381 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12485641813.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12485641873) 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 as a sum of consecutive naturals, namely, 6242820906 + 6242820907.
It is an arithmetic number, because the mean of its divisors is an integer number (6242820907).
Almost surely, 212485641813 is an apocalyptic number.
It is an amenable number.
12485641813 is a deficient number, since it is larger than the sum of its proper divisors (1).
12485641813 is an equidigital number, since it uses as much as digits as its factorization.
12485641813 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 184320, while the sum is 43.
The spelling of 12485641813 in words is "twelve billion, four hundred eighty-five million, six hundred forty-one thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •