Base | Representation |
---|---|
bin | 10011000110011110111100… |
… | …01101010100011101011011 |
3 | 12111201120012211200200020121 |
4 | 21203033132031110131123 |
5 | 21001144112041034321 |
6 | 225200245201134111 |
7 | 11563463363246413 |
oct | 1143173615243533 |
9 | 174646184620217 |
10 | 42004213221211 |
11 | 1242498335235a |
12 | 486484602a337 |
13 | 1a58c98986627 |
14 | a5302c743643 |
15 | 4cc95ca3b441 |
hex | 2633de35475b |
42004213221211 has 8 divisors (see below), whose sum is σ = 43481934906480. Its totient is φ = 40528444905312.
The previous prime is 42004213221169. The next prime is 42004213221239. The reversal of 42004213221211 is 11212231240024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42004213221211 - 219 = 42004212696923 is a prime.
It is a super-3 number, since 3×420042132212113 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42004213221281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488298580 + ... + 488384593.
It is an arithmetic number, because the mean of its divisors is an integer number (5435241863310).
Almost surely, 242004213221211 is an apocalyptic number.
42004213221211 is a deficient number, since it is larger than the sum of its proper divisors (1477721685269).
42004213221211 is a wasteful number, since it uses less digits than its factorization.
42004213221211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 976684685.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 42004213221211 its reverse (11212231240024), we get a palindrome (53216444461235).
The spelling of 42004213221211 in words is "forty-two trillion, four billion, two hundred thirteen million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •