Base | Representation |
---|---|
bin | 111110101110011010… |
… | …010001000000000000 |
3 | 20102211210002112000121 |
4 | 332232122101000000 |
5 | 2100413230133100 |
6 | 50535045430024 |
7 | 4603003625014 |
oct | 765632210000 |
9 | 212753075017 |
10 | 67350630400 |
11 | 26621747519 |
12 | 1107770b314 |
13 | 64745aa231 |
14 | 338cc02544 |
15 | 1b42c2c51a |
hex | fae691000 |
67350630400 has 117 divisors (see below), whose sum is σ = 167215357893. Its totient is φ = 26907033600.
The previous prime is 67350630397. The next prime is 67350630407. The reversal of 67350630400 is 403605376.
The square root of 67350630400 is 259520.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 24246226944 + 43104403456 = 155712^2 + 207616^2 .
It is a super-2 number, since 2×673506304002 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (67350630407) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 83045995 + ... + 83046805.
Almost surely, 267350630400 is an apocalyptic number.
67350630400 is the 259520-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67350630400
67350630400 is an abundant number, since it is smaller than the sum of its proper divisors (99864727493).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67350630400 is an frugal number, since it uses more digits than its factorization.
67350630400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1656 (or 818 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 34.
The spelling of 67350630400 in words is "sixty-seven billion, three hundred fifty million, six hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •