Base | Representation |
---|---|
bin | 10011010000000111010110… |
… | …10011011111100011110101 |
3 | 12112220012102002000110202022 |
4 | 21220003223103133203311 |
5 | 21022104334212101031 |
6 | 230012255230522525 |
7 | 11626420240464452 |
oct | 1150035323374365 |
9 | 175805362013668 |
10 | 42335145425141 |
11 | 12542263a10258 |
12 | 48b8a02666445 |
13 | 1a8125803ab8a |
14 | a65063a30829 |
15 | 4d637aab297b |
hex | 2680eb4df8f5 |
42335145425141 has 32 divisors (see below), whose sum is σ = 43680932536320. Its totient is φ = 41010144480000.
The previous prime is 42335145425039. The next prime is 42335145425149. The reversal of 42335145425141 is 14152454153324.
It is a cyclic number.
It is not a de Polignac number, because 42335145425141 - 226 = 42335078316277 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42335145425092 and 42335145425101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42335145425149) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2615371250 + ... + 2615387436.
It is an arithmetic number, because the mean of its divisors is an integer number (1365029141760).
Almost surely, 242335145425141 is an apocalyptic number.
It is an amenable number.
42335145425141 is a deficient number, since it is larger than the sum of its proper divisors (1345787111179).
42335145425141 is a wasteful number, since it uses less digits than its factorization.
42335145425141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17705.
The product of its digits is 1152000, while the sum is 44.
Adding to 42335145425141 its reverse (14152454153324), we get a palindrome (56487599578465).
The spelling of 42335145425141 in words is "forty-two trillion, three hundred thirty-five billion, one hundred forty-five million, four hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •