Base | Representation |
---|---|
bin | 110101011001110110100… |
… | …011110010100100100001 |
3 | 110222211122000200100111121 |
4 | 311121312203302210201 |
5 | 440111414114230244 |
6 | 11445531424012241 |
7 | 526066216126666 |
oct | 65316643624441 |
9 | 13884560610447 |
10 | 3669891164449 |
11 | 1195434985604 |
12 | 4b32bb161081 |
13 | 2080b91b9703 |
14 | c98a3541a6d |
15 | 656e0374c84 |
hex | 356768f2921 |
3669891164449 has 2 divisors, whose sum is σ = 3669891164450. Its totient is φ = 3669891164448.
The previous prime is 3669891164413. The next prime is 3669891164473. The reversal of 3669891164449 is 9444611989663.
3669891164449 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., 2528290803600 + 1141600360849 = 1590060^2 + 1068457^2 .
It is a cyclic number.
It is not a de Polignac number, because 3669891164449 - 225 = 3669857610017 is a prime.
It is a super-2 number, since 2×36698911644492 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3669891164479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1834945582224 + 1834945582225.
It is an arithmetic number, because the mean of its divisors is an integer number (1834945582225).
Almost surely, 23669891164449 is an apocalyptic number.
It is an amenable number.
3669891164449 is a deficient number, since it is larger than the sum of its proper divisors (1).
3669891164449 is an equidigital number, since it uses as much as digits as its factorization.
3669891164449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 241864704, while the sum is 70.
The spelling of 3669891164449 in words is "three trillion, six hundred sixty-nine billion, eight hundred ninety-one million, one hundred sixty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •