Base | Representation |
---|---|
bin | 10001100111001010010… |
… | …01111000011101010100 |
3 | 2010211222020122211100010 |
4 | 20303211021320131110 |
5 | 34403311314310302 |
6 | 1141555242120220 |
7 | 61501635040410 |
oct | 10634511703524 |
9 | 2124866584303 |
10 | 605139994452 |
11 | 2137028294a4 |
12 | 993441b0070 |
13 | 450ab7c3a46 |
14 | 21408b87d40 |
15 | 10b1b22916c |
hex | 8ce5278754 |
605139994452 has 48 divisors (see below), whose sum is σ = 1614796589952. Its totient is φ = 172780362240.
The previous prime is 605139994451. The next prime is 605139994477. The reversal of 605139994452 is 254499931506.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 605139994392 and 605139994401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (605139994451) 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 15 ways as a sum of consecutive naturals, for example, 2307753 + ... + 2556560.
It is an arithmetic number, because the mean of its divisors is an integer number (33641595624).
Almost surely, 2605139994452 is an apocalyptic number.
It is an amenable number.
605139994452 is an abundant number, since it is smaller than the sum of its proper divisors (1009656595500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
605139994452 is a wasteful number, since it uses less digits than its factorization.
605139994452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4865808 (or 4865806 counting only the distinct ones).
The product of its (nonzero) digits is 10497600, while the sum is 57.
The spelling of 605139994452 in words is "six hundred five billion, one hundred thirty-nine million, nine hundred ninety-four thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •