Base | Representation |
---|---|
bin | 101010011001111111… |
… | …000010001011110111 |
3 | 11100112021120200220200 |
4 | 222121333002023313 |
5 | 1221222434023111 |
6 | 32530112331543 |
7 | 3201232025562 |
oct | 523177021367 |
9 | 140467520820 |
10 | 45533111031 |
11 | 18346288281 |
12 | 89a8b43bb3 |
13 | 43a84ba265 |
14 | 22bd3a34d9 |
15 | 12b7647256 |
hex | a99fc22f7 |
45533111031 has 12 divisors (see below), whose sum is σ = 66671009808. Its totient is φ = 29939579424.
The previous prime is 45533111011. The next prime is 45533111053. The reversal of 45533111031 is 13011133554.
It is a happy number.
45533111031 is a `hidden beast` number, since 4 + 553 + 3 + 1 + 1 + 103 + 1 = 666.
It is not a de Polignac number, because 45533111031 - 211 = 45533108983 is a prime.
It is a super-2 number, since 2×455331110312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 45533110986 and 45533111004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45533111011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34651635 + ... + 34652948.
It is an arithmetic number, because the mean of its divisors is an integer number (5555917484).
Almost surely, 245533111031 is an apocalyptic number.
45533111031 is a deficient number, since it is larger than the sum of its proper divisors (21137898777).
45533111031 is a wasteful number, since it uses less digits than its factorization.
45533111031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69304662 (or 69304659 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 45533111031 its reverse (13011133554), we get a palindrome (58544244585).
The spelling of 45533111031 in words is "forty-five billion, five hundred thirty-three million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •