Base | Representation |
---|---|
bin | 101100111110100110001… |
… | …011111111101101101101 |
3 | 101221111002000112200200102 |
4 | 230332212023333231231 |
5 | 401120100112220422 |
6 | 10323531555240445 |
7 | 436210426344200 |
oct | 54764613775555 |
9 | 11844060480612 |
10 | 3090869648237 |
11 | a91915379418 |
12 | 41b045ba9125 |
13 | 19561087c727 |
14 | a98554cd937 |
15 | 55602104192 |
hex | 2cfa62ffb6d |
3090869648237 has 12 divisors (see below), whose sum is σ = 3807001512540. Its totient is φ = 2493474673536.
The previous prime is 3090869648227. The next prime is 3090869648257. The reversal of 3090869648237 is 7328469680903.
It can be written as a sum of positive squares in 2 ways, for example, as 1812871052041 + 1277998596196 = 1346429^2 + 1130486^2 .
It is not a de Polignac number, because 3090869648237 - 210 = 3090869647213 is a prime.
It is a super-2 number, since 2×30908696482372 (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 (3090869648227) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1855263062 + ... + 1855264727.
It is an arithmetic number, because the mean of its divisors is an integer number (317250126045).
Almost surely, 23090869648237 is an apocalyptic number.
It is an amenable number.
3090869648237 is a deficient number, since it is larger than the sum of its proper divisors (716131864303).
3090869648237 is a wasteful number, since it uses less digits than its factorization.
3090869648237 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3710527820 (or 3710527813 counting only the distinct ones).
The product of its (nonzero) digits is 94058496, while the sum is 65.
The spelling of 3090869648237 in words is "three trillion, ninety billion, eight hundred sixty-nine million, six hundred forty-eight thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •