Base | Representation |
---|---|
bin | 10010101011000101110100… |
… | …01111100110010011101001 |
3 | 12101101120210220112202011101 |
4 | 21111202322033212103221 |
5 | 20340234022033013001 |
6 | 223200030504401401 |
7 | 11435463501005344 |
oct | 1125427217462351 |
9 | 171346726482141 |
10 | 41063012001001 |
11 | 120a17a8844a51 |
12 | 4732353776261 |
13 | 19bb2c13172a3 |
14 | a1d66342345b |
15 | 4b322334aa01 |
hex | 2558ba3e64e9 |
41063012001001 has 8 divisors (see below), whose sum is σ = 42522191570880. Its totient is φ = 39606713340432.
The previous prime is 41063012000891. The next prime is 41063012001017. The reversal of 41063012001001 is 10010021036014.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41063012001001 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 41063012001001.
It is not an unprimeable number, because it can be changed into a prime (41063012001041) 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, 720198315 + ... + 720255328.
It is an arithmetic number, because the mean of its divisors is an integer number (5315273946360).
Almost surely, 241063012001001 is an apocalyptic number.
It is an amenable number.
41063012001001 is a deficient number, since it is larger than the sum of its proper divisors (1459179569879).
41063012001001 is a wasteful number, since it uses less digits than its factorization.
41063012001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1440454655.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 41063012001001 its reverse (10010021036014), we get a palindrome (51073033037015).
The spelling of 41063012001001 in words is "forty-one trillion, sixty-three billion, twelve million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •