Base | Representation |
---|---|
bin | 101111111000110111100… |
… | …110001101100001101101 |
3 | 102122121022221000002020222 |
4 | 233320313212031201231 |
5 | 412404204143244433 |
6 | 10555450334221125 |
7 | 456521006006150 |
oct | 57706746154155 |
9 | 12577287002228 |
10 | 3290877712493 |
11 | 1059720748398 |
12 | 4519643547a5 |
13 | 1ab436763347 |
14 | b53ca6adc97 |
15 | 5a90b11cb98 |
hex | 2fe3798d86d |
3290877712493 has 4 divisors (see below), whose sum is σ = 3761003100000. Its totient is φ = 2820752324988.
The previous prime is 3290877712471. The next prime is 3290877712511. The reversal of 3290877712493 is 3942177780923.
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 3290877712493 - 214 = 3290877696109 is a prime.
It is a super-2 number, since 2×32908777124932 (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 (3290877712393) 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, 235062693743 + ... + 235062693756.
It is an arithmetic number, because the mean of its divisors is an integer number (940250775000).
Almost surely, 23290877712493 is an apocalyptic number.
It is an amenable number.
3290877712493 is a deficient number, since it is larger than the sum of its proper divisors (470125387507).
3290877712493 is an equidigital number, since it uses as much as digits as its factorization.
3290877712493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470125387506.
The product of its (nonzero) digits is 32006016, while the sum is 62.
The spelling of 3290877712493 in words is "three trillion, two hundred ninety billion, eight hundred seventy-seven million, seven hundred twelve thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •