Base | Representation |
---|---|
bin | 111010110100100001001… |
… | …000101100111110011001 |
3 | 112022102102022012021101010 |
4 | 322310201020230332121 |
5 | 1012211230224430113 |
6 | 12332531355044133 |
7 | 565014335263662 |
oct | 72644110547631 |
9 | 15272368167333 |
10 | 4042120155033 |
11 | 13192874a4554 |
12 | 553481a40649 |
13 | 23422a1a49ac |
14 | dd8d5322369 |
15 | 70228b8b1c3 |
hex | 3ad2122cf99 |
4042120155033 has 8 divisors (see below), whose sum is σ = 5563348170496. Its totient is φ = 2607819454800.
The previous prime is 4042120155001. The next prime is 4042120155091. The reversal of 4042120155033 is 3305510212404.
4042120155033 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4042120155033 - 25 = 4042120155001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4042120155233) 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, 21731828698 + ... + 21731828883.
It is an arithmetic number, because the mean of its divisors is an integer number (695418521312).
Almost surely, 24042120155033 is an apocalyptic number.
It is an amenable number.
4042120155033 is a deficient number, since it is larger than the sum of its proper divisors (1521228015463).
4042120155033 is a wasteful number, since it uses less digits than its factorization.
4042120155033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43463657615.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 4042120155033 its reverse (3305510212404), we get a palindrome (7347630367437).
The spelling of 4042120155033 in words is "four trillion, forty-two billion, one hundred twenty million, one hundred fifty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.338 sec. • engine limits •