Base | Representation |
---|---|
bin | 100000010100010010110111… |
… | …111010001001110110001010 |
3 | 200122020200220102220020010111 |
4 | 200110102313322021312022 |
5 | 122112143112132000232 |
6 | 1222142334420104534 |
7 | 41636465002534324 |
oct | 4024226772116612 |
9 | 618220812806114 |
10 | 142132143234442 |
11 | 413189a3529999 |
12 | 13b361b323514a |
13 | 6140007b9424a |
14 | 2715337b48614 |
15 | 11672b3585047 |
hex | 8144b7e89d8a |
142132143234442 has 8 divisors (see below), whose sum is σ = 213643305072000. Its totient is φ = 70917708210444.
The previous prime is 142132143234439. The next prime is 142132143234443. The reversal of 142132143234442 is 244432341231241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1421321432344422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142132143234395 and 142132143234404.
It is not an unprimeable number, because it can be changed into a prime (142132143234443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74181702192 + ... + 74181704107.
It is an arithmetic number, because the mean of its divisors is an integer number (26705413134000).
Almost surely, 2142132143234442 is an apocalyptic number.
142132143234442 is a deficient number, since it is larger than the sum of its proper divisors (71511161837558).
142132143234442 is a wasteful number, since it uses less digits than its factorization.
142132143234442 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148363406780.
The product of its digits is 442368, while the sum is 40.
Adding to 142132143234442 its reverse (244432341231241), we get a palindrome (386564484465683).
The spelling of 142132143234442 in words is "one hundred forty-two trillion, one hundred thirty-two billion, one hundred forty-three million, two hundred thirty-four thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •