Base | Representation |
---|---|
bin | 100000011000100000010001… |
… | …010100111111100010001110 |
3 | 200200021100112200021222201202 |
4 | 200120200101110333202032 |
5 | 122131413020000014100 |
6 | 1222523254002305502 |
7 | 41666415133601465 |
oct | 4030402124774216 |
9 | 620240480258652 |
10 | 142421406251150 |
11 | 4141a640a01784 |
12 | 13b82280958292 |
13 | 61613864178b0 |
14 | 2725338cc39dc |
15 | 116ea9330a7d5 |
hex | 81881153f88e |
142421406251150 has 96 divisors (see below), whose sum is σ = 290237423616000. Its totient is φ = 51673489084800.
The previous prime is 142421406251107. The next prime is 142421406251167. The reversal of 142421406251150 is 51152604124241.
It is a super-4 number, since 4×1424214062511504 (a number of 58 digits) contains 4444 as substring.
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 47 ways as a sum of consecutive naturals, for example, 91227635 + ... + 92775665.
It is an arithmetic number, because the mean of its divisors is an integer number (3023306496000).
Almost surely, 2142421406251150 is an apocalyptic number.
142421406251150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
142421406251150 is an abundant number, since it is smaller than the sum of its proper divisors (147816017364850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142421406251150 is a wasteful number, since it uses less digits than its factorization.
142421406251150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1550514 (or 1550509 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 38.
The spelling of 142421406251150 in words is "one hundred forty-two trillion, four hundred twenty-one billion, four hundred six million, two hundred fifty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.382 sec. • engine limits •