Base | Representation |
---|---|
bin | 110010000101000110110… |
… | …010110110111100000111 |
3 | 110012000000000122011011221 |
4 | 302011012302312330013 |
5 | 422341100333311242 |
6 | 11152552221141211 |
7 | 503431333642321 |
oct | 62050662667407 |
9 | 13160000564157 |
10 | 3441456541447 |
11 | 1107571554281 |
12 | 476b889ba807 |
13 | 1bc6b2c07c32 |
14 | bc7d2c96611 |
15 | 5e7c0937167 |
hex | 32146cb6f07 |
3441456541447 has 2 divisors, whose sum is σ = 3441456541448. Its totient is φ = 3441456541446.
The previous prime is 3441456541361. The next prime is 3441456541499. The reversal of 3441456541447 is 7441456541443.
3441456541447 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (3441456541499) can be obtained adding 3441456541447 to its sum of digits (52).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3441456541447 - 27 = 3441456541319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3441456541394 and 3441456541403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3441456541147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1720728270723 + 1720728270724.
It is an arithmetic number, because the mean of its divisors is an integer number (1720728270724).
Almost surely, 23441456541447 is an apocalyptic number.
3441456541447 is a deficient number, since it is larger than the sum of its proper divisors (1).
3441456541447 is an equidigital number, since it uses as much as digits as its factorization.
3441456541447 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12902400, while the sum is 52.
The spelling of 3441456541447 in words is "three trillion, four hundred forty-one billion, four hundred fifty-six million, five hundred forty-one thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •