Base | Representation |
---|---|
bin | 10010101010001111110010… |
… | …01000000010000011001111 |
3 | 12101021210221011111201120112 |
4 | 21111013321020002003033 |
5 | 20334300114031223043 |
6 | 223134432124110235 |
7 | 11433415553604233 |
oct | 1125077110020317 |
9 | 171253834451515 |
10 | 41034002211023 |
11 | 12090471548408 |
12 | 47287b839537b |
13 | 19b864a1422a3 |
14 | a1c0b06d85c3 |
15 | 4b25c661c518 |
hex | 2551f92020cf |
41034002211023 has 8 divisors (see below), whose sum is σ = 41666915504160. Its totient is φ = 40402615851360.
The previous prime is 41034002210959. The next prime is 41034002211079. The reversal of 41034002211023 is 32011220043014.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41034002211023 - 26 = 41034002210959 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41034002211023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41034002211523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 381679208 + ... + 381786701.
It is an arithmetic number, because the mean of its divisors is an integer number (5208364438020).
Almost surely, 241034002211023 is an apocalyptic number.
41034002211023 is a deficient number, since it is larger than the sum of its proper divisors (632913293137).
41034002211023 is an equidigital number, since it uses as much as digits as its factorization.
41034002211023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 763466737.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 41034002211023 its reverse (32011220043014), we get a palindrome (73045222254037).
The spelling of 41034002211023 in words is "forty-one trillion, thirty-four billion, two million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •