Base | Representation |
---|---|
bin | 101101101001110100110… |
… | …101001111110011010101 |
3 | 102002220212212112221100222 |
4 | 231221310311033303111 |
5 | 402400130234211433 |
6 | 10401125512044125 |
7 | 442442610025025 |
oct | 55516465176325 |
9 | 12086785487328 |
10 | 3137286241493 |
11 | aaa574326998 |
12 | 42803a993645 |
13 | 199aca0cbc21 |
14 | abbb9d4da85 |
15 | 5691c0b3b98 |
hex | 2da74d4fcd5 |
3137286241493 has 4 divisors (see below), whose sum is σ = 3210246386688. Its totient is φ = 3064326096300.
The previous prime is 3137286241429. The next prime is 3137286241571. The reversal of 3137286241493 is 3941426827313.
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 3137286241493 - 26 = 3137286241429 is a prime.
It is a super-2 number, since 2×31372862414932 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3137286741493) 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, 36480072533 + ... + 36480072618.
It is an arithmetic number, because the mean of its divisors is an integer number (802561596672).
Almost surely, 23137286241493 is an apocalyptic number.
It is an amenable number.
3137286241493 is a deficient number, since it is larger than the sum of its proper divisors (72960145195).
3137286241493 is an equidigital number, since it uses as much as digits as its factorization.
3137286241493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72960145194.
The product of its digits is 5225472, while the sum is 53.
The spelling of 3137286241493 in words is "three trillion, one hundred thirty-seven billion, two hundred eighty-six million, two hundred forty-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •