Base | Representation |
---|---|
bin | 100111001101100011… |
… | …110011110101111101 |
3 | 11000200021000110111100 |
4 | 213031203303311331 |
5 | 1142211434003313 |
6 | 31201514243313 |
7 | 3020235120300 |
oct | 471543636575 |
9 | 130607013440 |
10 | 42103422333 |
11 | 16946314405 |
12 | 81b0426539 |
13 | 3c7ca9b06b |
14 | 2075aa8b37 |
15 | 11664c8173 |
hex | 9cd8f3d7d |
42103422333 has 72 divisors (see below), whose sum is σ = 71466071040. Its totient is φ = 23815270080.
The previous prime is 42103422323. The next prime is 42103422349. The reversal of 42103422333 is 33322430124.
42103422333 is a `hidden beast` number, since 421 + 0 + 3 + 4 + 2 + 233 + 3 = 666.
It is not a de Polignac number, because 42103422333 - 25 = 42103422301 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42103422297 and 42103422306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42103422323) 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 71 ways as a sum of consecutive naturals, for example, 19076116 + ... + 19078322.
It is an arithmetic number, because the mean of its divisors is an integer number (992584320).
Almost surely, 242103422333 is an apocalyptic number.
It is an amenable number.
42103422333 is a deficient number, since it is larger than the sum of its proper divisors (29362648707).
42103422333 is a wasteful number, since it uses less digits than its factorization.
42103422333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2647 (or 2637 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 42103422333 its reverse (33322430124), we get a palindrome (75425852457).
The spelling of 42103422333 in words is "forty-two billion, one hundred three million, four hundred twenty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •