Base | Representation |
---|---|
bin | 101101101110011011101… |
… | …111111111110110011001 |
3 | 102010101122200220102211001 |
4 | 231232123233333312121 |
5 | 402440243420103103 |
6 | 10403304502505001 |
7 | 443006330351146 |
oct | 55563357776631 |
9 | 12111580812731 |
10 | 3142234144153 |
11 | 1001683290445 |
12 | 428b9ba35161 |
13 | 19a408219890 |
14 | ac12912d3cd |
15 | 56b0b67901d |
hex | 2db9bbffd99 |
3142234144153 has 4 divisors (see below), whose sum is σ = 3383944462948. Its totient is φ = 2900523825360.
The previous prime is 3142234144031. The next prime is 3142234144201. The reversal of 3142234144153 is 3514414322413.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1896715647369 + 1245518496784 = 1377213^2 + 1116028^2 .
It is a cyclic number.
It is not a de Polignac number, because 3142234144153 - 213 = 3142234135961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3142234154153) 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, 120855159378 + ... + 120855159403.
It is an arithmetic number, because the mean of its divisors is an integer number (845986115737).
Almost surely, 23142234144153 is an apocalyptic number.
It is an amenable number.
3142234144153 is a deficient number, since it is larger than the sum of its proper divisors (241710318795).
3142234144153 is a wasteful number, since it uses less digits than its factorization.
3142234144153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241710318794.
The product of its digits is 138240, while the sum is 37.
Adding to 3142234144153 its reverse (3514414322413), we get a palindrome (6656648466566).
The spelling of 3142234144153 in words is "three trillion, one hundred forty-two billion, two hundred thirty-four million, one hundred forty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •