Base | Representation |
---|---|
bin | 10011110101010101100… |
… | …01111110111001000000 |
3 | 2102010222211011000122021 |
4 | 21322222301332321000 |
5 | 42131122313442034 |
6 | 1241021340251224 |
7 | 100143314645044 |
oct | 11725261767100 |
9 | 2363884130567 |
10 | 681470062144 |
11 | 2430120a2073 |
12 | b00a6b40b14 |
13 | 4c354501981 |
14 | 24daa36c024 |
15 | 12ad74206b4 |
hex | 9eaac7ee40 |
681470062144 has 63 divisors (see below), whose sum is σ = 1427474225691. Its totient is φ = 322742171520.
The previous prime is 681470062121. The next prime is 681470062159. The reversal of 681470062144 is 441260074186.
It is a happy number.
The square root of 681470062144 is 825512.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 681470062144.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 125475109 + ... + 125480539.
Almost surely, 2681470062144 is an apocalyptic number.
681470062144 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
681470062144 is the 825512-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 681470062144
681470062144 is an abundant number, since it is smaller than the sum of its proper divisors (746004163547).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
681470062144 is an frugal number, since it uses more digits than its factorization.
681470062144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10912 (or 5452 counting only the distinct ones).
The product of its (nonzero) digits is 258048, while the sum is 43.
The spelling of 681470062144 in words is "six hundred eighty-one billion, four hundred seventy million, sixty-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •