Base | Representation |
---|---|
bin | 1000010010001100101… |
… | …1110111010001101011 |
3 | 111121100211011011110212 |
4 | 2010203023313101223 |
5 | 4312440000431243 |
6 | 145214410131335 |
7 | 13165633010516 |
oct | 2044313672153 |
9 | 447324134425 |
10 | 142324233323 |
11 | 553a5357028 |
12 | 23700120b4b |
13 | 1056227039c |
14 | 6c621a7d7d |
15 | 3a7eccd318 |
hex | 21232f746b |
142324233323 has 2 divisors, whose sum is σ = 142324233324. Its totient is φ = 142324233322.
The previous prime is 142324233281. The next prime is 142324233407. The reversal of 142324233323 is 323332423241.
It is a happy number.
142324233323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 142324233323 - 226 = 142257124459 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142324233323.
It is not a weakly prime, because it can be changed into another prime (142324235323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71162116661 + 71162116662.
It is an arithmetic number, because the mean of its divisors is an integer number (71162116662).
Almost surely, 2142324233323 is an apocalyptic number.
142324233323 is a deficient number, since it is larger than the sum of its proper divisors (1).
142324233323 is an equidigital number, since it uses as much as digits as its factorization.
142324233323 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 62208, while the sum is 32.
Adding to 142324233323 its reverse (323332423241), we get a palindrome (465656656564).
The spelling of 142324233323 in words is "one hundred forty-two billion, three hundred twenty-four million, two hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •