Base | Representation |
---|---|
bin | 10011010010101101011101… |
… | …01001111001101011000111 |
3 | 12120012201120221212010110012 |
4 | 21221112232221321223013 |
5 | 21030040002440433221 |
6 | 230121244202420435 |
7 | 11636025152543450 |
oct | 1151265651715307 |
9 | 176181527763405 |
10 | 42424322202311 |
11 | 125770659798a5 |
12 | 491214b80171b |
13 | 1a8979a438c4a |
14 | a694c347a127 |
15 | 4d8849a2b65b |
hex | 2695aea79ac7 |
42424322202311 has 8 divisors (see below), whose sum is σ = 48485012183424. Its totient is φ = 36363650352120.
The previous prime is 42424322202293. The next prime is 42424322202343. The reversal of 42424322202311 is 11320222342424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42424322202311 - 26 = 42424322202247 is a prime.
It is a super-2 number, since 2×424243222023112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42424322202011) 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, 918356 + ... + 9256998.
It is an arithmetic number, because the mean of its divisors is an integer number (6060626522928).
Almost surely, 242424322202311 is an apocalyptic number.
42424322202311 is a deficient number, since it is larger than the sum of its proper divisors (6060689981113).
42424322202311 is an equidigital number, since it uses as much as digits as its factorization.
42424322202311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9065461.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 42424322202311 its reverse (11320222342424), we get a palindrome (53744544544735).
The spelling of 42424322202311 in words is "forty-two trillion, four hundred twenty-four billion, three hundred twenty-two million, two hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •