Base | Representation |
---|---|
bin | 101101101101100101011… |
… | …010000011000011000111 |
3 | 102010022022011100001222111 |
4 | 231231211122003003013 |
5 | 402431412014423143 |
6 | 10403034213241451 |
7 | 442644620003365 |
oct | 55554532030307 |
9 | 12108264301874 |
10 | 3141322420423 |
11 | 1001255680960 |
12 | 428986633287 |
13 | 19a2c1379b95 |
14 | ac080000635 |
15 | 56aa65d399d |
hex | 2db656830c7 |
3141322420423 has 8 divisors (see below), whose sum is σ = 3458336610960. Its totient is φ = 2829548134080.
The previous prime is 3141322420363. The next prime is 3141322420427. The reversal of 3141322420423 is 3240242231413.
3141322420423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3141322420423 - 213 = 3141322412231 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3141322420427) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1309974790 + ... + 1309977187.
It is an arithmetic number, because the mean of its divisors is an integer number (432292076370).
Almost surely, 23141322420423 is an apocalyptic number.
3141322420423 is a deficient number, since it is larger than the sum of its proper divisors (317014190537).
3141322420423 is a wasteful number, since it uses less digits than its factorization.
3141322420423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2619952097.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 3141322420423 its reverse (3240242231413), we get a palindrome (6381564651836).
The spelling of 3141322420423 in words is "three trillion, one hundred forty-one billion, three hundred twenty-two million, four hundred twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •