Base | Representation |
---|---|
bin | 100110110111000010001… |
… | …110001011101001011001 |
3 | 100110021212002011121011020 |
4 | 212313002032023221121 |
5 | 322223021344012231 |
6 | 5402440254553053 |
7 | 363634552402554 |
oct | 46670216135131 |
9 | 10407762147136 |
10 | 2670433188441 |
11 | 93a584a0a327 |
12 | 37166a808789 |
13 | 164a892cab35 |
14 | 9336d0ad69b |
15 | 496e64c8396 |
hex | 26dc238ba59 |
2670433188441 has 4 divisors (see below), whose sum is σ = 3560577584592. Its totient is φ = 1780288792292.
The previous prime is 2670433188407. The next prime is 2670433188457. The reversal of 2670433188441 is 1448813340762.
2670433188441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2670433188441 - 210 = 2670433187417 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2670433188461) 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, 445072198071 + ... + 445072198076.
It is an arithmetic number, because the mean of its divisors is an integer number (890144396148).
Almost surely, 22670433188441 is an apocalyptic number.
It is an amenable number.
2670433188441 is a deficient number, since it is larger than the sum of its proper divisors (890144396151).
2670433188441 is an equidigital number, since it uses as much as digits as its factorization.
2670433188441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890144396150.
The product of its (nonzero) digits is 3096576, while the sum is 51.
The spelling of 2670433188441 in words is "two trillion, six hundred seventy billion, four hundred thirty-three million, one hundred eighty-eight thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •