Base | Representation |
---|---|
bin | 100110001101001011… |
… | …111110001010100101 |
3 | 10220212222211020100200 |
4 | 212031023332022211 |
5 | 1133003444300313 |
6 | 30502414301113 |
7 | 2651412261423 |
oct | 461513761245 |
9 | 126788736320 |
10 | 41023431333 |
11 | 16441726165 |
12 | 7b4a7b7799 |
13 | 3b3a104931 |
14 | 1db2498113 |
15 | 1101795b73 |
hex | 98d2fe2a5 |
41023431333 has 12 divisors (see below), whose sum is σ = 59566311168. Its totient is φ = 27205764840.
The previous prime is 41023431331. The next prime is 41023431343. The reversal of 41023431333 is 33313432014.
41023431333 is a `hidden beast` number, since 410 + 234 + 3 + 13 + 3 + 3 = 666.
It is not a de Polignac number, because 41023431333 - 21 = 41023431331 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41023431297 and 41023431306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41023431331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11930635 + ... + 11934072.
It is an arithmetic number, because the mean of its divisors is an integer number (4963859264).
Almost surely, 241023431333 is an apocalyptic number.
It is an amenable number.
41023431333 is a deficient number, since it is larger than the sum of its proper divisors (18542879835).
41023431333 is a wasteful number, since it uses less digits than its factorization.
41023431333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23864904 (or 23864901 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 41023431333 its reverse (33313432014), we get a palindrome (74336863347).
The spelling of 41023431333 in words is "forty-one billion, twenty-three million, four hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •