Base | Representation |
---|---|
bin | 1111111001000100001011… |
… | …00010110001000111001001 |
3 | 11120201210222101220212211021 |
4 | 13330202011202301013021 |
5 | 14040024100131412131 |
6 | 202154003015432441 |
7 | 10234525540216432 |
oct | 774420542610711 |
9 | 146653871825737 |
10 | 34946094404041 |
11 | 10153612280507 |
12 | 3b04954385721 |
13 | 1666530576772 |
14 | 88b585824489 |
15 | 409064d2be11 |
hex | 1fc8858b11c9 |
34946094404041 has 2 divisors, whose sum is σ = 34946094404042. Its totient is φ = 34946094404040.
The previous prime is 34946094403981. The next prime is 34946094404071. The reversal of 34946094404041 is 14040449064943.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32419358440000 + 2526735964041 = 5693800^2 + 1589571^2 .
It is a cyclic number.
It is not a de Polignac number, because 34946094404041 - 223 = 34946086015433 is a prime.
It is a super-2 number, since 2×349460944040412 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 34946094404041.
It is not a weakly prime, because it can be changed into another prime (34946094404071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17473047202020 + 17473047202021.
It is an arithmetic number, because the mean of its divisors is an integer number (17473047202021).
Almost surely, 234946094404041 is an apocalyptic number.
It is an amenable number.
34946094404041 is a deficient number, since it is larger than the sum of its proper divisors (1).
34946094404041 is an equidigital number, since it uses as much as digits as its factorization.
34946094404041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5971968, while the sum is 52.
The spelling of 34946094404041 in words is "thirty-four trillion, nine hundred forty-six billion, ninety-four million, four hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •