Base | Representation |
---|---|
bin | 100000010111100100000110… |
… | …001100001011000111001111 |
3 | 200200001011202210121021121121 |
4 | 200113210012030023013033 |
5 | 122124333203442133323 |
6 | 1222433450404341411 |
7 | 41661640041162412 |
oct | 4027440614130717 |
9 | 620034683537547 |
10 | 142356794880463 |
11 | 413a51a5526669 |
12 | 13b7184a6a4867 |
13 | 615825a4bb9c7 |
14 | 2722169c13b79 |
15 | 116d060d1aa5d |
hex | 81790630b1cf |
142356794880463 has 2 divisors, whose sum is σ = 142356794880464. Its totient is φ = 142356794880462.
The previous prime is 142356794880451. The next prime is 142356794880473. The reversal of 142356794880463 is 364088497653241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 142356794880463 - 241 = 140157771624911 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142356794880392 and 142356794880401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142356794880403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71178397440231 + 71178397440232.
It is an arithmetic number, because the mean of its divisors is an integer number (71178397440232).
It is a 2-persistent number, because it is pandigital, and so is 2⋅142356794880463 = 284713589760926, but 3⋅142356794880463 = 427070384641389 is not.
Almost surely, 2142356794880463 is an apocalyptic number.
142356794880463 is a deficient number, since it is larger than the sum of its proper divisors (1).
142356794880463 is an equidigital number, since it uses as much as digits as its factorization.
142356794880463 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 836075520, while the sum is 70.
The spelling of 142356794880463 in words is "one hundred forty-two trillion, three hundred fifty-six billion, seven hundred ninety-four million, eight hundred eighty thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •