Base | Representation |
---|---|
bin | 100111110001000111011… |
… | …0001100000111111001000 |
3 | 201100111122121220000020000 |
4 | 1033202032301200333020 |
5 | 1204022013444322402 |
6 | 15342505322203000 |
7 | 1102606336204266 |
oct | 117421661407710 |
9 | 21314577800200 |
10 | 5465593745352 |
11 | 1817a441aa664 |
12 | 743328353460 |
13 | 308532007080 |
14 | 14c771299436 |
15 | 9728c9a8c1c |
hex | 4f88ec60fc8 |
5465593745352 has 80 divisors (see below), whose sum is σ = 16486317341340. Its totient is φ = 1681721149824.
The previous prime is 5465593745309. The next prime is 5465593745411. The reversal of 5465593745352 is 2535473955645.
5465593745352 is a `hidden beast` number, since 5 + 4 + 6 + 5 + 5 + 93 + 7 + 4 + 535 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5265950994756 + 199642750596 = 2294766^2 + 446814^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 5465593745352.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 324397663 + ... + 324414510.
Almost surely, 25465593745352 is an apocalyptic number.
5465593745352 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5465593745352 is an abundant number, since it is smaller than the sum of its proper divisors (11020723595988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5465593745352 is a wasteful number, since it uses less digits than its factorization.
5465593745352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648812204 (or 648812191 counting only the distinct ones).
The product of its digits is 340200000, while the sum is 63.
The spelling of 5465593745352 in words is "five trillion, four hundred sixty-five billion, five hundred ninety-three million, seven hundred forty-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •