Base | Representation |
---|---|
bin | 1110010010011110100101… |
… | …10101100000001011001111 |
3 | 11010020211200001112012221021 |
4 | 13021033102311200023033 |
5 | 13104301131042323043 |
6 | 150454413252415011 |
7 | 6422052124561036 |
oct | 711172265401317 |
9 | 133224601465837 |
10 | 31421223011023 |
11 | a01473627067a |
12 | 3635788017467 |
13 | 146c015c10cc1 |
14 | 7a8b1c47b71d |
15 | 3975112383ed |
hex | 1c93d2d602cf |
31421223011023 has 4 divisors (see below), whose sum is σ = 32089759670880. Its totient is φ = 30752686351168.
The previous prime is 31421223011011. The next prime is 31421223011033. The reversal of 31421223011023 is 32011032212413.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31421223011023 - 229 = 31420686140111 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 (31421223011033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 334268329858 + ... + 334268329951.
It is an arithmetic number, because the mean of its divisors is an integer number (8022439917720).
Almost surely, 231421223011023 is an apocalyptic number.
31421223011023 is a deficient number, since it is larger than the sum of its proper divisors (668536659857).
31421223011023 is an equidigital number, since it uses as much as digits as its factorization.
31421223011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668536659856.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 31421223011023 its reverse (32011032212413), we get a palindrome (63432255223436).
The spelling of 31421223011023 in words is "thirty-one trillion, four hundred twenty-one billion, two hundred twenty-three million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •