Base | Representation |
---|---|
bin | 110011001010110000010… |
… | …011110011100100111001 |
3 | 110110011000220012222000202 |
4 | 303022300103303210321 |
5 | 430102230223331022 |
6 | 11251201112411545 |
7 | 512016510211556 |
oct | 63126023634471 |
9 | 13404026188022 |
10 | 3516241230137 |
11 | 1136258562819 |
12 | 48957a0a6bb5 |
13 | 1c67706c590c |
14 | c2289123a2d |
15 | 616eb11d592 |
hex | 332b04f3939 |
3516241230137 has 2 divisors, whose sum is σ = 3516241230138. Its totient is φ = 3516241230136.
The previous prime is 3516241230011. The next prime is 3516241230163. The reversal of 3516241230137 is 7310321426153.
3516241230137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1958597451001 + 1557643779136 = 1399499^2 + 1248056^2 .
It is a cyclic number.
It is not a de Polignac number, because 3516241230137 - 214 = 3516241213753 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3516241230137.
It is not a weakly prime, because it can be changed into another prime (3516241260137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1758120615068 + 1758120615069.
It is an arithmetic number, because the mean of its divisors is an integer number (1758120615069).
Almost surely, 23516241230137 is an apocalyptic number.
It is an amenable number.
3516241230137 is a deficient number, since it is larger than the sum of its proper divisors (1).
3516241230137 is an equidigital number, since it uses as much as digits as its factorization.
3516241230137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 38.
The spelling of 3516241230137 in words is "three trillion, five hundred sixteen billion, two hundred forty-one million, two hundred thirty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •