Base | Representation |
---|---|
bin | 1010001011111011010111… |
… | …1001010001111011110001 |
3 | 1110122201020110002022000000 |
4 | 2202332311321101323301 |
5 | 2432000131021314213 |
6 | 35453120131220213 |
7 | 2234114135253144 |
oct | 242766571217361 |
9 | 43581213068000 |
10 | 11200031432433 |
11 | 36289a7839828 |
12 | 130a783a47669 |
13 | 63320a0ca1ac |
14 | 2aa1278ba05b |
15 | 14651278bc73 |
hex | a2fb5e51ef1 |
11200031432433 has 28 divisors (see below), whose sum is σ = 16794335769360. Its totient is φ = 7465811489496.
The previous prime is 11200031432411. The next prime is 11200031432437. The reversal of 11200031432433 is 33423413000211.
It is a happy number.
11200031432433 is a `hidden beast` number, since 1 + 1 + 20 + 0 + 0 + 314 + 324 + 3 + 3 = 666.
It is not a de Polignac number, because 11200031432433 - 210 = 11200031431409 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11200031432397 and 11200031432406.
It is not an unprimeable number, because it can be changed into a prime (11200031432437) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 5345338 + ... + 7139516.
Almost surely, 211200031432433 is an apocalyptic number.
It is an amenable number.
11200031432433 is a deficient number, since it is larger than the sum of its proper divisors (5594304336927).
11200031432433 is an frugal number, since it uses more digits than its factorization.
11200031432433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1802760 (or 1802745 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 11200031432433 its reverse (33423413000211), we get a palindrome (44623444432644).
The spelling of 11200031432433 in words is "eleven trillion, two hundred billion, thirty-one million, four hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •