Base | Representation |
---|---|
bin | 100000010111100010101001… |
… | …000011100100010110100111 |
3 | 200200001000201220102011210212 |
4 | 200113202221003210112213 |
5 | 122124322003434442323 |
6 | 1222433031350010035 |
7 | 41661553235633066 |
oct | 4027425103442647 |
9 | 620030656364725 |
10 | 142355232343463 |
11 | 413a4573512477 |
12 | 13b7149334691b |
13 | 615806b871ab9 |
14 | 272205c4b21dd |
15 | 116cebda6bb78 |
hex | 8178a90e45a7 |
142355232343463 has 8 divisors (see below), whose sum is σ = 142758990219888. Its totient is φ = 141951477209344.
The previous prime is 142355232343397. The next prime is 142355232343477. The reversal of 142355232343463 is 364343232553241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142355232343463 - 224 = 142355215566247 is a prime.
It is a super-2 number, since 2×1423552323434632 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142355232343063) 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, 150443981 + ... + 151387257.
It is an arithmetic number, because the mean of its divisors is an integer number (17844873777486).
Almost surely, 2142355232343463 is an apocalyptic number.
142355232343463 is a deficient number, since it is larger than the sum of its proper divisors (403757876425).
142355232343463 is an equidigital number, since it uses as much as digits as its factorization.
142355232343463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1371153.
The product of its digits is 18662400, while the sum is 50.
The spelling of 142355232343463 in words is "one hundred forty-two trillion, three hundred fifty-five billion, two hundred thirty-two million, three hundred forty-three thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •