Base | Representation |
---|---|
bin | 110000001100101000100… |
… | …011010001011010000111 |
3 | 102201122002221201002122012 |
4 | 300030220203101122013 |
5 | 413231140112321244 |
6 | 11013320252124435 |
7 | 461201633336003 |
oct | 60145043213207 |
9 | 12648087632565 |
10 | 3312100120199 |
11 | 1067721198412 |
12 | 455aa776671b |
13 | 1b0439479740 |
14 | b6441079703 |
15 | 5b24e34d89e |
hex | 303288d1687 |
3312100120199 has 8 divisors (see below), whose sum is σ = 3567156089952. Its totient is φ = 3057084012960.
The previous prime is 3312100120187. The next prime is 3312100120211. The reversal of 3312100120199 is 9910210012133.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (3312100120187) and next prime (3312100120211).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3312100120199 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3312100720199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9792944 + ... + 10125509.
It is an arithmetic number, because the mean of its divisors is an integer number (445894511244).
Almost surely, 23312100120199 is an apocalyptic number.
3312100120199 is a deficient number, since it is larger than the sum of its proper divisors (255055969753).
3312100120199 is a wasteful number, since it uses less digits than its factorization.
3312100120199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19931257.
The product of its (nonzero) digits is 2916, while the sum is 32.
The spelling of 3312100120199 in words is "three trillion, three hundred twelve billion, one hundred million, one hundred twenty thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •