Base | Representation |
---|---|
bin | 100100011110100010… |
… | …000101001110000000 |
3 | 10202002121112112112102 |
4 | 210132202011032000 |
5 | 1120203220101131 |
6 | 25554255445532 |
7 | 2554410431210 |
oct | 443642051600 |
9 | 122077475472 |
10 | 39166956416 |
11 | 156797a9075 |
12 | 7710b268a8 |
13 | 3902600273 |
14 | 1c77ac0240 |
15 | 10437d41cb |
hex | 91e885380 |
39166956416 has 128 divisors (see below), whose sum is σ = 92793643200. Its totient is φ = 16111484928.
The previous prime is 39166956397. The next prime is 39166956419. The reversal of 39166956416 is 61465966193.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (39166956419) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4490876 + ... + 4499588.
Almost surely, 239166956416 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 39166956416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46396821600).
39166956416 is an abundant number, since it is smaller than the sum of its proper divisors (53626686784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
39166956416 is a wasteful number, since it uses less digits than its factorization.
39166956416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8936 (or 8924 counting only the distinct ones).
The product of its digits is 6298560, while the sum is 56.
The spelling of 39166956416 in words is "thirty-nine billion, one hundred sixty-six million, nine hundred fifty-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •