Base | Representation |
---|---|
bin | 1001100000100001011011… |
… | …1000101000010100110001 |
3 | 1101000102110112110012111212 |
4 | 2120020112320220110301 |
5 | 2332240434042424244 |
6 | 34122353242445505 |
7 | 2126205102500054 |
oct | 230102670502461 |
9 | 41012415405455 |
10 | 10454334342449 |
11 | 3370727213068 |
12 | 120a153503895 |
13 | 5aaabb4bb44a |
14 | 281dc7528a9b |
15 | 131e1b99ad9e |
hex | 98216e28531 |
10454334342449 has 2 divisors, whose sum is σ = 10454334342450. Its totient is φ = 10454334342448.
The previous prime is 10454334342427. The next prime is 10454334342461. The reversal of 10454334342449 is 94424343345401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10147684204849 + 306650137600 = 3185543^2 + 553760^2 .
It is a cyclic number.
It is not a de Polignac number, because 10454334342449 - 216 = 10454334276913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10454334342397 and 10454334342406.
It is not a weakly prime, because it can be changed into another prime (10454334342469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5227167171224 + 5227167171225.
It is an arithmetic number, because the mean of its divisors is an integer number (5227167171225).
Almost surely, 210454334342449 is an apocalyptic number.
It is an amenable number.
10454334342449 is a deficient number, since it is larger than the sum of its proper divisors (1).
10454334342449 is an equidigital number, since it uses as much as digits as its factorization.
10454334342449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9953280, while the sum is 50.
The spelling of 10454334342449 in words is "ten trillion, four hundred fifty-four billion, three hundred thirty-four million, three hundred forty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •