Base | Representation |
---|---|
bin | 1100000011010100101001… |
… | …1100001111011001011101 |
3 | 1201220210201111221111122001 |
4 | 3000311022130033121131 |
5 | 3214102001043301440 |
6 | 44103310001522301 |
7 | 2535240442155412 |
oct | 300651234173135 |
9 | 51823644844561 |
10 | 13251223025245 |
11 | 42498a2a36a07 |
12 | 15a0213943391 |
13 | 75177b240b8a |
14 | 33b51103c109 |
15 | 17ea64a38b9a |
hex | c0d4a70f65d |
13251223025245 has 4 divisors (see below), whose sum is σ = 15901467630300. Its totient is φ = 10600978420192.
The previous prime is 13251223025129. The next prime is 13251223025251. The reversal of 13251223025245 is 54252032215231.
13251223025245 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10364523482404 + 2886699542841 = 3219398^2 + 1699029^2 .
It is a cyclic number.
It is not a de Polignac number, because 13251223025245 - 229 = 13250686154333 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1325122302520 + ... + 1325122302529.
It is an arithmetic number, because the mean of its divisors is an integer number (3975366907575).
Almost surely, 213251223025245 is an apocalyptic number.
It is an amenable number.
13251223025245 is a deficient number, since it is larger than the sum of its proper divisors (2650244605055).
13251223025245 is an equidigital number, since it uses as much as digits as its factorization.
13251223025245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2650244605054.
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 13251223025245 in words is "thirteen trillion, two hundred fifty-one billion, two hundred twenty-three million, twenty-five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •