Base | Representation |
---|---|
bin | 10011010110001110100010… |
… | …01101110010111001001100 |
3 | 12120122021111102121020112101 |
4 | 21223013101031302321030 |
5 | 21034024442221340411 |
6 | 230252551024044444 |
7 | 11650533516446125 |
oct | 1153072115627114 |
9 | 176567442536471 |
10 | 42545161121356 |
11 | 12613335337243 |
12 | 4931654463724 |
13 | 1a97cb73819ca |
14 | a712a7d9d04c |
15 | 4dba6d4958c1 |
hex | 26b1d1372e4c |
42545161121356 has 48 divisors (see below), whose sum is σ = 77791648112640. Its totient is φ = 20321384409920.
The previous prime is 42545161121273. The next prime is 42545161121363. The reversal of 42545161121356 is 65312116154524.
42545161121356 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (46).
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 15 ways as a sum of consecutive naturals, for example, 238597425 + ... + 238775671.
It is an arithmetic number, because the mean of its divisors is an integer number (1620659335680).
Almost surely, 242545161121356 is an apocalyptic number.
42545161121356 is a gapful number since it is divisible by the number (46) formed by its first and last digit.
It is an amenable number.
42545161121356 is a deficient number, since it is larger than the sum of its proper divisors (35246486991284).
42545161121356 is a wasteful number, since it uses less digits than its factorization.
42545161121356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181614 (or 181612 counting only the distinct ones).
The product of its digits is 864000, while the sum is 46.
The spelling of 42545161121356 in words is "forty-two trillion, five hundred forty-five billion, one hundred sixty-one million, one hundred twenty-one thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •