Base | Representation |
---|---|
bin | 1110001001001010010110… |
… | …10010110111001101000011 |
3 | 11002010020102121220212211011 |
4 | 13010211023102313031003 |
5 | 13034030044041114433 |
6 | 150051354040501351 |
7 | 6356660532156061 |
oct | 704451322671503 |
9 | 132106377825734 |
10 | 31101121426243 |
11 | 9a00a032711a0 |
12 | 35a373277a857 |
13 | 1447a9165a83b |
14 | 79743376d031 |
15 | 38e028e443cd |
hex | 1c494b4b7343 |
31101121426243 has 8 divisors (see below), whose sum is σ = 35714206422720. Its totient is φ = 26785654816680.
The previous prime is 31101121426237. The next prime is 31101121426253. The reversal of 31101121426243 is 34262412110113.
It is a happy number.
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 31101121426243 - 213 = 31101121418051 is a prime.
It is a super-2 number, since 2×311011214262432 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (31101121426223) 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, 74404596505 + ... + 74404596922.
It is an arithmetic number, because the mean of its divisors is an integer number (4464275802840).
Almost surely, 231101121426243 is an apocalyptic number.
31101121426243 is a deficient number, since it is larger than the sum of its proper divisors (4613084996477).
31101121426243 is a wasteful number, since it uses less digits than its factorization.
31101121426243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148809193457.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 31101121426243 its reverse (34262412110113), we get a palindrome (65363533536356).
The spelling of 31101121426243 in words is "thirty-one trillion, one hundred one billion, one hundred twenty-one million, four hundred twenty-six thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •