Base | Representation |
---|---|
bin | 100000010011111110011101… |
… | …111101010000010110011111 |
3 | 200122011121100110221011112202 |
4 | 200103332131331100112133 |
5 | 122111313224122102143 |
6 | 1222124312331522115 |
7 | 41635061023616636 |
oct | 4023763575202637 |
9 | 618147313834482 |
10 | 142110233003423 |
11 | 4130a67a7a7053 |
12 | 13b31ab95b933b |
13 | 613ac25812cc9 |
14 | 2714259c9451d |
15 | 116692ec89ab8 |
hex | 813f9df5059f |
142110233003423 has 24 divisors (see below), whose sum is σ = 149277738355200. Its totient is φ = 135254485285920.
The previous prime is 142110233003377. The next prime is 142110233003429. The reversal of 142110233003423 is 324300332011241.
It is not a de Polignac number, because 142110233003423 - 222 = 142110228809119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142110233003429) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 358485878 + ... + 358882076.
It is an arithmetic number, because the mean of its divisors is an integer number (6219905764800).
Almost surely, 2142110233003423 is an apocalyptic number.
142110233003423 is a deficient number, since it is larger than the sum of its proper divisors (7167505351777).
142110233003423 is an equidigital number, since it uses as much as digits as its factorization.
142110233003423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402335 (or 402306 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 142110233003423 its reverse (324300332011241), we get a palindrome (466410565014664).
The spelling of 142110233003423 in words is "one hundred forty-two trillion, one hundred ten billion, two hundred thirty-three million, three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •