Base | Representation |
---|---|
bin | 1011011010001110100110… |
… | …1100110111000001011001 |
3 | 1122102022102022202220112012 |
4 | 2312203221230313001121 |
5 | 3121020110142332403 |
6 | 42403110313355305 |
7 | 2433235244040005 |
oct | 266435154670131 |
9 | 48368368686465 |
10 | 12545225355353 |
11 | 3aa7444729139 |
12 | 14a7422708b35 |
13 | 700018342952 |
14 | 315299373705 |
15 | 16b4e4158ed8 |
hex | b68e9b37059 |
12545225355353 has 4 divisors (see below), whose sum is σ = 12662470452240. Its totient is φ = 12427980258468.
The previous prime is 12545225355263. The next prime is 12545225355391. The reversal of 12545225355353 is 35355352254521.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12545225355353 - 28 = 12545225355097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12545225355253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58622548283 + ... + 58622548496.
It is an arithmetic number, because the mean of its divisors is an integer number (3165617613060).
Almost surely, 212545225355353 is an apocalyptic number.
It is an amenable number.
12545225355353 is a deficient number, since it is larger than the sum of its proper divisors (117245096887).
12545225355353 is a wasteful number, since it uses less digits than its factorization.
12545225355353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117245096886.
The product of its digits is 13500000, while the sum is 50.
The spelling of 12545225355353 in words is "twelve trillion, five hundred forty-five billion, two hundred twenty-five million, three hundred fifty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •