Base | Representation |
---|---|
bin | 1010100101100101011010111… |
… | …0111001010110111100001101 |
3 | 10121200212110212002211122011100 |
4 | 2221121112232321112330031 |
5 | 1240122240100114400323 |
6 | 11200301523345213313 |
7 | 312632234142116361 |
oct | 25131265671267415 |
9 | 3550773762748140 |
10 | 745012256403213 |
11 | 1a6424a183458a7 |
12 | 6b684449331239 |
13 | 25c9247b5bb176 |
14 | d1d8add9c52a1 |
15 | 5b1e729de7943 |
hex | 2a595aee56f0d |
745012256403213 has 12 divisors (see below), whose sum is σ = 1076417089381660. Its totient is φ = 496541787797376.
The previous prime is 745012256403209. The next prime is 745012256403241. The reversal of 745012256403213 is 312304652210547.
745012256403213 is a `hidden beast` number, since 7 + 4 + 5 + 0 + 1 + 2 + 25 + 6 + 403 + 213 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 173810525773284 + 571201730629929 = 13183722^2 + 23899827^2 .
It is not a de Polignac number, because 745012256403213 - 22 = 745012256403209 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (745012256403313) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11087448268 + ... + 11087515461.
Almost surely, 2745012256403213 is an apocalyptic number.
It is an amenable number.
745012256403213 is a deficient number, since it is larger than the sum of its proper divisors (331404832978447).
745012256403213 is a wasteful number, since it uses less digits than its factorization.
745012256403213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22174967468 (or 22174967465 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 45.
The spelling of 745012256403213 in words is "seven hundred forty-five trillion, twelve billion, two hundred fifty-six million, four hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •