Base | Representation |
---|---|
bin | 10011001001111001101100… |
… | …00100001110110011101100 |
3 | 12112010210100022020210011102 |
4 | 21210330312010032303230 |
5 | 21010110120221211024 |
6 | 225330230335542232 |
7 | 11605121534005646 |
oct | 1144746604166354 |
9 | 175123308223142 |
10 | 42121651350764 |
11 | 1246a768095277 |
12 | 488355b98a978 |
13 | 1a6709318b10b |
14 | a589ad731896 |
15 | 4d0a32b441ae |
hex | 264f3610ecec |
42121651350764 has 6 divisors (see below), whose sum is σ = 73712889863844. Its totient is φ = 21060825675380.
The previous prime is 42121651350739. The next prime is 42121651350767. The reversal of 42121651350764 is 46705315612124.
42121651350764 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (42121651350767) 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 as a sum of consecutive naturals, namely, 5265206418842 + ... + 5265206418849.
It is an arithmetic number, because the mean of its divisors is an integer number (12285481643974).
Almost surely, 242121651350764 is an apocalyptic number.
It is an amenable number.
42121651350764 is a deficient number, since it is larger than the sum of its proper divisors (31591238513080).
42121651350764 is a wasteful number, since it uses less digits than its factorization.
42121651350764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10530412837695 (or 10530412837693 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 47.
Adding to 42121651350764 its reverse (46705315612124), we get a palindrome (88826966962888).
The spelling of 42121651350764 in words is "forty-two trillion, one hundred twenty-one billion, six hundred fifty-one million, three hundred fifty thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •