Base | Representation |
---|---|
bin | 10011101000000111000… |
… | …11010000100100000000 |
3 | 2101110122222002001012221 |
4 | 21310003203100210000 |
5 | 42022102034040000 |
6 | 1233445005300424 |
7 | 66502334442544 |
oct | 11640343204400 |
9 | 2343588061187 |
10 | 674369440000 |
11 | 23aaa8a71603 |
12 | aa844b64714 |
13 | 4b7923c7cc9 |
14 | 248d52dba24 |
15 | 1281dd7c61a |
hex | 9d038d0900 |
674369440000 has 135 divisors (see below), whose sum is σ = 1682912071533. Its totient is φ = 269616384000.
The previous prime is 674369439983. The next prime is 674369440021. The reversal of 674369440000 is 44963476.
The square root of 674369440000 is 821200.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 509156456704 + 165212983296 = 713552^2 + 406464^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 328478974 + ... + 328481026.
Almost surely, 2674369440000 is an apocalyptic number.
674369440000 is the 821200-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 674369440000
674369440000 is an abundant number, since it is smaller than the sum of its proper divisors (1008542631533).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674369440000 is an frugal number, since it uses more digits than its factorization.
674369440000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4142 (or 2060 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 43.
The spelling of 674369440000 in words is "six hundred seventy-four billion, three hundred sixty-nine million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •