Base | Representation |
---|---|
bin | 100101110011110010… |
… | …110110000100000000 |
3 | 10212210022012022122021 |
4 | 211303302312010000 |
5 | 1131120414223034 |
6 | 30352235251224 |
7 | 2635020220000 |
oct | 456362660400 |
9 | 125708168567 |
10 | 40597414144 |
11 | 16243200141 |
12 | 7a4bba9b14 |
13 | 3a9ca84161 |
14 | 1d71a80000 |
15 | 10c91936b4 |
hex | 973cb6100 |
40597414144 has 135 divisors (see below), whose sum is σ = 94905938477. Its totient is φ = 17331191808.
The previous prime is 40597414141. The next prime is 40597414159. The reversal of 40597414144 is 44141479504.
The square root of 40597414144 is 201488.
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., 39968006400 + 629407744 = 199920^2 + 25088^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 40597414144.
It is not an unprimeable number, because it can be changed into a prime (40597414141) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 157966464 + ... + 157966720.
Almost surely, 240597414144 is an apocalyptic number.
40597414144 is the 201488-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40597414144
40597414144 is an abundant number, since it is smaller than the sum of its proper divisors (54308524333).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40597414144 is an frugal number, since it uses more digits than its factorization.
40597414144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558 (or 266 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 43.
The spelling of 40597414144 in words is "forty billion, five hundred ninety-seven million, four hundred fourteen thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •