Base | Representation |
---|---|
bin | 1101010000101000011… |
… | …01100101110011001101 |
3 | 1121112222221101120121200 |
4 | 12220110031211303031 |
5 | 24431040020443042 |
6 | 545145150020113 |
7 | 44626222021455 |
oct | 6502415456315 |
9 | 1545887346550 |
10 | 455605640397 |
11 | 166248563006 |
12 | 743714a7639 |
13 | 33c6a85b93b |
14 | 180a11a8d65 |
15 | bcb8478c4c |
hex | 6a14365ccd |
455605640397 has 12 divisors (see below), whose sum is σ = 658484858460. Its totient is φ = 303558098688.
The previous prime is 455605640393. The next prime is 455605640419. The reversal of 455605640397 is 793046506554.
455605640397 is a `hidden beast` number, since 4 + 5 + 560 + 5 + 6 + 40 + 39 + 7 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 377365718601 + 78239921796 = 614301^2 + 279714^2 .
It is not a de Polignac number, because 455605640397 - 22 = 455605640393 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (455605640393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14900122 + ... + 14930667.
It is an arithmetic number, because the mean of its divisors is an integer number (54873738205).
Almost surely, 2455605640397 is an apocalyptic number.
It is an amenable number.
455605640397 is a deficient number, since it is larger than the sum of its proper divisors (202879218063).
455605640397 is a wasteful number, since it uses less digits than its factorization.
455605640397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29832492 (or 29832489 counting only the distinct ones).
The product of its (nonzero) digits is 13608000, while the sum is 54.
The spelling of 455605640397 in words is "four hundred fifty-five billion, six hundred five million, six hundred forty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •