Base | Representation |
---|---|
bin | 10010101111101101111111… |
… | …11000100101011011001011 |
3 | 12101221210020110221102120001 |
4 | 21113312333320211123023 |
5 | 20400340144211440243 |
6 | 223401045034543431 |
7 | 11453123044200610 |
oct | 1127667770453313 |
9 | 171853213842501 |
10 | 41222020421323 |
11 | 12153184965675 |
12 | 475912b297b77 |
13 | 1a002b2004571 |
14 | a2722937c507 |
15 | 4b742cc1ba4d |
hex | 257dbfe256cb |
41222020421323 has 16 divisors (see below), whose sum is σ = 47761123350976. Its totient is φ = 34845577297920.
The previous prime is 41222020421297. The next prime is 41222020421359. The reversal of 41222020421323 is 32312402022214.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41222020421323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41222020421291 and 41222020421300.
It is not an unprimeable number, because it can be changed into a prime (41222020421723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 874315 + ... + 9121867.
It is an arithmetic number, because the mean of its divisors is an integer number (2985070209436).
Almost surely, 241222020421323 is an apocalyptic number.
41222020421323 is a deficient number, since it is larger than the sum of its proper divisors (6539102929653).
41222020421323 is an equidigital number, since it uses as much as digits as its factorization.
41222020421323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8257414.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 41222020421323 its reverse (32312402022214), we get a palindrome (73534422443537).
The spelling of 41222020421323 in words is "forty-one trillion, two hundred twenty-two billion, twenty million, four hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •