Base | Representation |
---|---|
bin | 100000011010001010011100… |
… | …001100111100111110101011 |
3 | 200200200020210110200000211110 |
4 | 200122022130030330332223 |
5 | 122140300002230420001 |
6 | 1223051510010201403 |
7 | 42010562135004150 |
oct | 4032123414747653 |
9 | 620606713600743 |
10 | 142535405326251 |
11 | 41463a20464133 |
12 | 13ba0396a23263 |
13 | 616c0532a1212 |
14 | 272aa7125a227 |
15 | 1172a165443d6 |
hex | 81a29c33cfab |
142535405326251 has 16 divisors (see below), whose sum is σ = 217228838536448. Its totient is φ = 81436791636000.
The previous prime is 142535405326241. The next prime is 142535405326267. The reversal of 142535405326251 is 152623504535241.
142535405326251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 142535405326251 - 26 = 142535405326187 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 142535405326251.
It is not an unprimeable number, because it can be changed into a prime (142535405326211) 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, 500329525 + ... + 500614326.
It is an arithmetic number, because the mean of its divisors is an integer number (13576802408528).
Almost surely, 2142535405326251 is an apocalyptic number.
142535405326251 is a deficient number, since it is larger than the sum of its proper divisors (74693433210197).
142535405326251 is a wasteful number, since it uses less digits than its factorization.
142535405326251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000950642.
The product of its (nonzero) digits is 4320000, while the sum is 48.
The spelling of 142535405326251 in words is "one hundred forty-two trillion, five hundred thirty-five billion, four hundred five million, three hundred twenty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •