Base | Representation |
---|---|
bin | 100111001000101101… |
… | …100110100100100101 |
3 | 11000110121000000210112 |
4 | 213020231212210211 |
5 | 1142030124301313 |
6 | 31145451302405 |
7 | 3015226661540 |
oct | 471055464445 |
9 | 130417000715 |
10 | 42022103333 |
11 | 16904422221 |
12 | 818914aa05 |
13 | 3c68c98502 |
14 | 2068d7b857 |
15 | 115e2b38a8 |
hex | 9c8b66925 |
42022103333 has 16 divisors (see below), whose sum is σ = 50170238976. Its totient is φ = 34413770160.
The previous prime is 42022103267. The next prime is 42022103339. The reversal of 42022103333 is 33330122024.
It is not a de Polignac number, because 42022103333 - 28 = 42022103077 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 42022103299 and 42022103308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42022103339) 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 15 ways as a sum of consecutive naturals, for example, 5633 + ... + 289958.
It is an arithmetic number, because the mean of its divisors is an integer number (3135639936).
Almost surely, 242022103333 is an apocalyptic number.
It is an amenable number.
42022103333 is a deficient number, since it is larger than the sum of its proper divisors (8148135643).
42022103333 is a wasteful number, since it uses less digits than its factorization.
42022103333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296504.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 42022103333 its reverse (33330122024), we get a palindrome (75352225357).
The spelling of 42022103333 in words is "forty-two billion, twenty-two million, one hundred three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •