Base | Representation |
---|---|
bin | 10011101100010101111100… |
… | …01001000100010001111110 |
3 | 12200022220220102012110120002 |
4 | 21312022332021010101332 |
5 | 21134002220340414032 |
6 | 232034022050554302 |
7 | 12056454342224213 |
oct | 1166127611042176 |
9 | 180286812173502 |
10 | 43305050326142 |
11 | 12886628a48900 |
12 | 4a34985898992 |
13 | 1b21858325817 |
14 | a99d93155b0a |
15 | 5016e51b7862 |
hex | 2762be24447e |
43305050326142 has 48 divisors (see below), whose sum is σ = 73824667476336. Its totient is φ = 19024536220800.
The previous prime is 43305050326051. The next prime is 43305050326247. The reversal of 43305050326142 is 24162305050334.
43305050326142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 43305050326096 and 43305050326105.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 19333433 + ... + 21456740.
It is an arithmetic number, because the mean of its divisors is an integer number (1538013905757).
Almost surely, 243305050326142 is an apocalyptic number.
43305050326142 is a deficient number, since it is larger than the sum of its proper divisors (30519617150194).
43305050326142 is a wasteful number, since it uses less digits than its factorization.
43305050326142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40790345 (or 40790334 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 38.
Adding to 43305050326142 its reverse (24162305050334), we get a palindrome (67467355376476).
The spelling of 43305050326142 in words is "forty-three trillion, three hundred five billion, fifty million, three hundred twenty-six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •