Base | Representation |
---|---|
bin | 1110001010011100101110… |
… | …00111001111111111010101 |
3 | 11002021110120111211212010002 |
4 | 13011032113013033333111 |
5 | 13040241130314422123 |
6 | 150123550105141045 |
7 | 6363114431325641 |
oct | 705162707177725 |
9 | 132243514755102 |
10 | 31145343123413 |
11 | 9a18736265862 |
12 | 35b021448a785 |
13 | 144bcbb24485c |
14 | 79962a8bdc21 |
15 | 390266394528 |
hex | 1c53971cffd5 |
31145343123413 has 4 divisors (see below), whose sum is σ = 31145502608160. Its totient is φ = 31145183638668.
The previous prime is 31145343123359. The next prime is 31145343123469. The reversal of 31145343123413 is 31432134354113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31145343123413 - 226 = 31145276014549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31145343120413) 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, 79449083 + ... + 79840136.
It is an arithmetic number, because the mean of its divisors is an integer number (7786375652040).
Almost surely, 231145343123413 is an apocalyptic number.
It is an amenable number.
31145343123413 is a deficient number, since it is larger than the sum of its proper divisors (159484747).
31145343123413 is a wasteful number, since it uses less digits than its factorization.
31145343123413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159484746.
The product of its digits is 155520, while the sum is 38.
Adding to 31145343123413 its reverse (31432134354113), we get a palindrome (62577477477526).
The spelling of 31145343123413 in words is "thirty-one trillion, one hundred forty-five billion, three hundred forty-three million, one hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •