Base | Representation |
---|---|
bin | 100000011000100000111000… |
… | …100010111001000011011101 |
3 | 200200021102020112100120011120 |
4 | 200120200320202321003131 |
5 | 122131420341414043140 |
6 | 1222523443144441153 |
7 | 41666440343246361 |
oct | 4030407042710335 |
9 | 620242215316146 |
10 | 142422064206045 |
11 | 4141a949343a58 |
12 | 13b824251791b9 |
13 | 616145c825610 |
14 | 272539c4352a1 |
15 | 116ead0e751d0 |
hex | 8188388b90dd |
142422064206045 has 128 divisors (see below), whose sum is σ = 251597035339776. Its totient is φ = 68358086424576.
The previous prime is 142422064206029. The next prime is 142422064206119. The reversal of 142422064206045 is 540602460224241.
It is not a de Polignac number, because 142422064206045 - 24 = 142422064206029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142422064205988 and 142422064206006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2983449417 + ... + 2983497153.
It is an arithmetic number, because the mean of its divisors is an integer number (1965601838592).
Almost surely, 2142422064206045 is an apocalyptic number.
142422064206045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142422064206045 is a deficient number, since it is larger than the sum of its proper divisors (109174971133731).
142422064206045 is a wasteful number, since it uses less digits than its factorization.
142422064206045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49059.
The product of its (nonzero) digits is 737280, while the sum is 42.
The spelling of 142422064206045 in words is "one hundred forty-two trillion, four hundred twenty-two billion, sixty-four million, two hundred six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •