Base | Representation |
---|---|
bin | 111101100110010101000… |
… | …011001111001000001101 |
3 | 112222200020002001001210220 |
4 | 331212111003033020031 |
5 | 1023323233110041031 |
6 | 13000344443421553 |
7 | 614553522365235 |
oct | 75462503171015 |
9 | 15880202031726 |
10 | 4233043440141 |
11 | 139225073748a |
12 | 5844858248b9 |
13 | 249235b93849 |
14 | 108c47b3ccc5 |
15 | 751a032d596 |
hex | 3d9950cf20d |
4233043440141 has 16 divisors (see below), whose sum is σ = 5674738316544. Its totient is φ = 2806699017024.
The previous prime is 4233043440097. The next prime is 4233043440167. The reversal of 4233043440141 is 1410443403324.
4233043440141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4233043440141 - 211 = 4233043438093 is a prime.
It is a super-2 number, since 2×42330434401412 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4233043400141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 372636 + ... + 2933418.
It is an arithmetic number, because the mean of its divisors is an integer number (354671144784).
Almost surely, 24233043440141 is an apocalyptic number.
It is an amenable number.
4233043440141 is a deficient number, since it is larger than the sum of its proper divisors (1441694876403).
4233043440141 is a wasteful number, since it uses less digits than its factorization.
4233043440141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2563780.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 4233043440141 its reverse (1410443403324), we get a palindrome (5643486843465).
The spelling of 4233043440141 in words is "four trillion, two hundred thirty-three billion, forty-three million, four hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •