Base | Representation |
---|---|
bin | 10001110010010011110101… |
… | …10110110110100100001001 |
3 | 12010111001222212002211111120 |
4 | 20321021322312312210021 |
5 | 20111302421022201001 |
6 | 215103453050145453 |
7 | 11144515435334205 |
oct | 1071117266664411 |
9 | 163431885084446 |
10 | 39112033397001 |
11 | 1150a358227584 |
12 | 4478210a22289 |
13 | 18a9330b67416 |
14 | 993065325b05 |
15 | 47c5d8d5b236 |
hex | 23927adb6909 |
39112033397001 has 8 divisors (see below), whose sum is σ = 52357144309344. Its totient is φ = 25970805708000.
The previous prime is 39112033396991. The next prime is 39112033397023. The reversal of 39112033397001 is 10079333021193.
39112033397001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 39112033397001 - 237 = 38974594443529 is a prime.
It is not an unprimeable number, because it can be changed into a prime (39112033397081) 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 7 ways as a sum of consecutive naturals, for example, 25970804956 + ... + 25970806461.
It is an arithmetic number, because the mean of its divisors is an integer number (6544643038668).
Almost surely, 239112033397001 is an apocalyptic number.
It is an amenable number.
39112033397001 is a deficient number, since it is larger than the sum of its proper divisors (13245110912343).
39112033397001 is a wasteful number, since it uses less digits than its factorization.
39112033397001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51941611671.
The product of its (nonzero) digits is 91854, while the sum is 42.
The spelling of 39112033397001 in words is "thirty-nine trillion, one hundred twelve billion, thirty-three million, three hundred ninety-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •