Base | Representation |
---|---|
bin | 1110010010011110110011… |
… | …11000000001111111100101 |
3 | 11010020211222021202111020020 |
4 | 13021033121320001333211 |
5 | 13104301401311124331 |
6 | 150454433112025353 |
7 | 6422055060462423 |
oct | 711173170017745 |
9 | 133224867674206 |
10 | 31421341114341 |
11 | a0147969a7422 |
12 | 36357bb692259 |
13 | 146c034522819 |
14 | 7a8b30022113 |
15 | 39751b7b6c96 |
hex | 1c93d9e01fe5 |
31421341114341 has 8 divisors (see below), whose sum is σ = 42049716031104. Its totient is φ = 20870263470240.
The previous prime is 31421341114231. The next prime is 31421341114391. The reversal of 31421341114341 is 14341114312413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31421341114341 - 213 = 31421341106149 is a prime.
It is a super-2 number, since 2×314213411143412 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31421341114391) 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, 19324317216 + ... + 19324318841.
It is an arithmetic number, because the mean of its divisors is an integer number (5256214503888).
Almost surely, 231421341114341 is an apocalyptic number.
It is an amenable number.
31421341114341 is a deficient number, since it is larger than the sum of its proper divisors (10628374916763).
31421341114341 is a wasteful number, since it uses less digits than its factorization.
31421341114341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38648636331.
The product of its digits is 13824, while the sum is 33.
Adding to 31421341114341 its reverse (14341114312413), we get a palindrome (45762455426754).
The spelling of 31421341114341 in words is "thirty-one trillion, four hundred twenty-one billion, three hundred forty-one million, one hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •