Base | Representation |
---|---|
bin | 10010001011001111011100… |
… | …01100101000110010110011 |
3 | 12020111222010010022122121000 |
4 | 21011213232030220302303 |
5 | 20214321312221321012 |
6 | 221001204020533043 |
7 | 11263432553545530 |
oct | 1105475614506263 |
9 | 166458103278530 |
10 | 39968666979507 |
11 | 1180a686590012 |
12 | 4596241851183 |
13 | 193c04bca5956 |
14 | 9c26cadd5d87 |
15 | 494a2407dddc |
hex | 2459ee328cb3 |
39968666979507 has 128 divisors (see below), whose sum is σ = 71354245529600. Its totient is φ = 21600528567552.
The previous prime is 39968666979503. The next prime is 39968666979529. The reversal of 39968666979507 is 70597966686993.
39968666979507 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 39968666979507 - 22 = 39968666979503 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (39968666979503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6614040828 + ... + 6614046870.
It is an arithmetic number, because the mean of its divisors is an integer number (557455043200).
Almost surely, 239968666979507 is an apocalyptic number.
39968666979507 is a deficient number, since it is larger than the sum of its proper divisors (31385578550093).
39968666979507 is a wasteful number, since it uses less digits than its factorization.
39968666979507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8894 (or 8888 counting only the distinct ones).
The product of its (nonzero) digits is 49997969280, while the sum is 90.
The spelling of 39968666979507 in words is "thirty-nine trillion, nine hundred sixty-eight billion, six hundred sixty-six million, nine hundred seventy-nine thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •