Base | Representation |
---|---|
bin | 100000010011111111010011… |
… | …011100010101011110110111 |
3 | 200122011200200000102202111220 |
4 | 200103333103130111132313 |
5 | 122111322043331441401 |
6 | 1222124541345001423 |
7 | 41635122201106221 |
oct | 4023772334253667 |
9 | 618150600382456 |
10 | 142111130343351 |
11 | 4130aaa02818a4 |
12 | 13b3210a023273 |
13 | 613b0396b7990 |
14 | 271430311b411 |
15 | 116698393d336 |
hex | 813fd37157b7 |
142111130343351 has 16 divisors (see below), whose sum is σ = 212929051485696. Its totient is φ = 83650698796896.
The previous prime is 142111130343337. The next prime is 142111130343359. The reversal of 142111130343351 is 153343031111241.
It is a happy number.
It is not a de Polignac number, because 142111130343351 - 27 = 142111130343223 is a prime.
It is a super-2 number, since 2×1421111303433512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142111130343359) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79214675995 + ... + 79214677788.
It is an arithmetic number, because the mean of its divisors is an integer number (13308065717856).
Almost surely, 2142111130343351 is an apocalyptic number.
142111130343351 is a deficient number, since it is larger than the sum of its proper divisors (70817921142345).
142111130343351 is a wasteful number, since it uses less digits than its factorization.
142111130343351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158429353822.
The product of its (nonzero) digits is 12960, while the sum is 33.
Adding to 142111130343351 its reverse (153343031111241), we get a palindrome (295454161454592).
The spelling of 142111130343351 in words is "one hundred forty-two trillion, one hundred eleven billion, one hundred thirty million, three hundred forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •