Base | Representation |
---|---|
bin | 100000010111000010110001… |
… | …011100011101000101011111 |
3 | 200122220202102010100000211201 |
4 | 200113002301130131011133 |
5 | 122123241413404043110 |
6 | 1222405212042100331 |
7 | 41656232246153023 |
oct | 4027026134350537 |
9 | 618822363300751 |
10 | 142321013346655 |
11 | 41391003807720 |
12 | 13b669234aa6a7 |
13 | 6154a773ac3b0 |
14 | 27205339c8383 |
15 | 116c16985eb3a |
hex | 8170b171d15f |
142321013346655 has 64 divisors (see below), whose sum is σ = 201744974204928. Its totient is φ = 95019721090560.
The previous prime is 142321013346581. The next prime is 142321013346667. The reversal of 142321013346655 is 556643310123241.
It is a happy number.
It is not a de Polignac number, because 142321013346655 - 211 = 142321013344607 is a prime.
It is a super-5 number, since 5×1423210133466555 (a number of 72 digits) contains 55555 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 (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 341083162 + ... + 341500168.
It is an arithmetic number, because the mean of its divisors is an integer number (3152265221952).
Almost surely, 2142321013346655 is an apocalyptic number.
142321013346655 is a deficient number, since it is larger than the sum of its proper divisors (59423960858273).
142321013346655 is a wasteful number, since it uses less digits than its factorization.
142321013346655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419656.
The product of its (nonzero) digits is 1555200, while the sum is 46.
Adding to 142321013346655 its reverse (556643310123241), we get a palindrome (698964323469896).
The spelling of 142321013346655 in words is "one hundred forty-two trillion, three hundred twenty-one billion, thirteen million, three hundred forty-six thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •