Base | Representation |
---|---|
bin | 110100111110001001111… |
… | …000000110001100111001 |
3 | 110212222212100100020100202 |
4 | 310332021320012030321 |
5 | 434120012010440034 |
6 | 11424132334011545 |
7 | 523664215406102 |
oct | 64761170061471 |
9 | 13788770306322 |
10 | 3640150483769 |
11 | 118386305aa68 |
12 | 4a959b046bb5 |
13 | 20535977aac7 |
14 | c828171b3a9 |
15 | 64a4e3c147e |
hex | 34f89e06339 |
3640150483769 has 2 divisors, whose sum is σ = 3640150483770. Its totient is φ = 3640150483768.
The previous prime is 3640150483757. The next prime is 3640150483777. The reversal of 3640150483769 is 9673840510463.
3640150483769 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., 3415152048169 + 224998435600 = 1848013^2 + 474340^2 .
It is a cyclic number.
It is not a de Polignac number, because 3640150483769 - 28 = 3640150483513 is a prime.
It is a super-2 number, since 2×36401504837692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3640150483729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1820075241884 + 1820075241885.
It is an arithmetic number, because the mean of its divisors is an integer number (1820075241885).
Almost surely, 23640150483769 is an apocalyptic number.
It is an amenable number.
3640150483769 is a deficient number, since it is larger than the sum of its proper divisors (1).
3640150483769 is an equidigital number, since it uses as much as digits as its factorization.
3640150483769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 56.
The spelling of 3640150483769 in words is "three trillion, six hundred forty billion, one hundred fifty million, four hundred eighty-three thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •