Base | Representation |
---|---|
bin | 10010101101001000010111… |
… | …11101010101010000001001 |
3 | 12101122021201122000222221212 |
4 | 21112210023331111100021 |
5 | 20342411043204433001 |
6 | 223252141505342505 |
7 | 11443524423520223 |
oct | 1126441375252011 |
9 | 171567648028855 |
10 | 41133102421001 |
11 | 121194a5a84998 |
12 | 4743a54937a35 |
13 | 19c4ab13ccaa6 |
14 | a22bd2055413 |
15 | 4b4e7686c7bb |
hex | 25690bf55409 |
41133102421001 has 2 divisors, whose sum is σ = 41133102421002. Its totient is φ = 41133102421000.
The previous prime is 41133102420983. The next prime is 41133102421009. The reversal of 41133102421001 is 10012420133114.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36067231360000 + 5065871061001 = 6005600^2 + 2250749^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41133102421001 is a prime.
It is a super-2 number, since 2×411331024210012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41133102421009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20566551210500 + 20566551210501.
It is an arithmetic number, because the mean of its divisors is an integer number (20566551210501).
Almost surely, 241133102421001 is an apocalyptic number.
It is an amenable number.
41133102421001 is a deficient number, since it is larger than the sum of its proper divisors (1).
41133102421001 is an equidigital number, since it uses as much as digits as its factorization.
41133102421001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 41133102421001 its reverse (10012420133114), we get a palindrome (51145522554115).
The spelling of 41133102421001 in words is "forty-one trillion, one hundred thirty-three billion, one hundred two million, four hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •