Base | Representation |
---|---|
bin | 10010101010001110100000… |
… | …11110011111000101001011 |
3 | 12101021202011122020120012011 |
4 | 21111013100132133011023 |
5 | 20334242214434344433 |
6 | 223134240323000351 |
7 | 11433362633065054 |
oct | 1125072036370513 |
9 | 171252148216164 |
10 | 41033320231243 |
11 | 1209015159695a |
12 | 4728647b090b7 |
13 | 19b856ba72162 |
14 | a1c047cd172b |
15 | 4b25868093cd |
hex | 2551d079f14b |
41033320231243 has 2 divisors, whose sum is σ = 41033320231244. Its totient is φ = 41033320231242.
The previous prime is 41033320231207. The next prime is 41033320231297. The reversal of 41033320231243 is 34213202333014.
It is a happy number.
41033320231243 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 41033320231243 - 29 = 41033320230731 is a prime.
It is not a weakly prime, because it can be changed into another prime (41033320234243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20516660115621 + 20516660115622.
It is an arithmetic number, because the mean of its divisors is an integer number (20516660115622).
Almost surely, 241033320231243 is an apocalyptic number.
41033320231243 is a deficient number, since it is larger than the sum of its proper divisors (1).
41033320231243 is an equidigital number, since it uses as much as digits as its factorization.
41033320231243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 41033320231243 its reverse (34213202333014), we get a palindrome (75246522564257).
The spelling of 41033320231243 in words is "forty-one trillion, thirty-three billion, three hundred twenty million, two hundred thirty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •