Base | Representation |
---|---|
bin | 100000010111010111100111… |
… | …111010110100010101000001 |
3 | 200122222220012102202011112220 |
4 | 200113113213322310111001 |
5 | 122124123241420043241 |
6 | 1222423353423041253 |
7 | 41660654125423224 |
oct | 4027274772642501 |
9 | 618886172664486 |
10 | 142343402112321 |
11 | 4139a552675743 |
12 | 13b6b131440229 |
13 | 6156c0493b327 |
14 | 27216592475bb |
15 | 116ca2a183166 |
hex | 8175e7eb4541 |
142343402112321 has 32 divisors (see below), whose sum is σ = 196028426996352. Its totient is φ = 91826274608640.
The previous prime is 142343402112287. The next prime is 142343402112337. The reversal of 142343402112321 is 123211204343241.
142343402112321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 142343402112321 - 27 = 142343402112193 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (142343402112341) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 331060546 + ... + 331490228.
It is an arithmetic number, because the mean of its divisors is an integer number (6125888343636).
Almost surely, 2142343402112321 is an apocalyptic number.
It is an amenable number.
142343402112321 is a deficient number, since it is larger than the sum of its proper divisors (53685024884031).
142343402112321 is a wasteful number, since it uses less digits than its factorization.
142343402112321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458353.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 142343402112321 its reverse (123211204343241), we get a palindrome (265554606455562).
The spelling of 142343402112321 in words is "one hundred forty-two trillion, three hundred forty-three billion, four hundred two million, one hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •