Base | Representation |
---|---|
bin | 100110101010010011… |
… | …111010010110100101 |
3 | 10222011001020202002100 |
4 | 212222103322112211 |
5 | 1140004041132013 |
6 | 31023111202313 |
7 | 2666464423026 |
oct | 465223722645 |
9 | 128131222070 |
10 | 41512052133 |
11 | 16672520202 |
12 | 8066376399 |
13 | 3bb7404476 |
14 | 201b32ac4d |
15 | 112e612473 |
hex | 9aa4fa5a5 |
41512052133 has 12 divisors (see below), whose sum is σ = 59972766048. Its totient is φ = 27669664680.
The previous prime is 41512052119. The next prime is 41512052137. The reversal of 41512052133 is 33125021514.
41512052133 is a `hidden beast` number, since 4 + 15 + 120 + 521 + 3 + 3 = 666.
It is not a de Polignac number, because 41512052133 - 218 = 41511789989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41512052097 and 41512052106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41512052137) 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, 367185 + ... + 466742.
It is an arithmetic number, because the mean of its divisors is an integer number (4997730504).
Almost surely, 241512052133 is an apocalyptic number.
It is an amenable number.
41512052133 is a deficient number, since it is larger than the sum of its proper divisors (18460713915).
41512052133 is a wasteful number, since it uses less digits than its factorization.
41512052133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839464 (or 839461 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 41512052133 its reverse (33125021514), we get a palindrome (74637073647).
The spelling of 41512052133 in words is "forty-one billion, five hundred twelve million, fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •