Base | Representation |
---|---|
bin | 100000011010000101110100… |
… | …000001011110110111000011 |
3 | 200200122202222011111111000020 |
4 | 200122011310001132313003 |
5 | 122140204313140411423 |
6 | 1223045324542024523 |
7 | 42010325036450301 |
oct | 4032056401366703 |
9 | 620582864444006 |
10 | 142530436263363 |
11 | 41461900567695 |
12 | 13b9b42a878143 |
13 | 616b740985015 |
14 | 272a71d32d271 |
15 | 117282519e4e3 |
hex | 81a17405edc3 |
142530436263363 has 8 divisors (see below), whose sum is σ = 190040704815888. Its totient is φ = 95020229276544.
The previous prime is 142530436263361. The next prime is 142530436263403. The reversal of 142530436263363 is 363362634035241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142530436263363 - 21 = 142530436263361 is a prime.
It is a super-3 number, since 3×1425304362633633 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (142530436263361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9687570 + ... + 19465607.
It is an arithmetic number, because the mean of its divisors is an integer number (23755088101986).
Almost surely, 2142530436263363 is an apocalyptic number.
142530436263363 is a deficient number, since it is larger than the sum of its proper divisors (47510268552525).
142530436263363 is a wasteful number, since it uses less digits than its factorization.
142530436263363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30782853.
The product of its (nonzero) digits is 16796160, while the sum is 51.
The spelling of 142530436263363 in words is "one hundred forty-two trillion, five hundred thirty billion, four hundred thirty-six million, two hundred sixty-three thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •