Base | Representation |
---|---|
bin | 10100111000011101… |
… | …01111001001100111 |
3 | 1001221022120000101210 |
4 | 22130032233021213 |
5 | 140430011342211 |
6 | 5052243322503 |
7 | 544551203550 |
oct | 123416571147 |
9 | 31838500353 |
10 | 11211043431 |
11 | 4833383955 |
12 | 220a680433 |
13 | 109887a413 |
14 | 784d29327 |
15 | 45937a9a6 |
hex | 29c3af267 |
11211043431 has 32 divisors (see below), whose sum is σ = 18094883328. Its totient is φ = 6027310080.
The previous prime is 11211043429. The next prime is 11211043511. The reversal of 11211043431 is 13434011211.
It is not a de Polignac number, because 11211043431 - 21 = 11211043429 is a prime.
It is a super-2 number, since 2×112110434312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 11211043398 and 11211043407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211043421) 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 31 ways as a sum of consecutive naturals, for example, 1843011 + ... + 1849083.
It is an arithmetic number, because the mean of its divisors is an integer number (565465104).
Almost surely, 211211043431 is an apocalyptic number.
11211043431 is a deficient number, since it is larger than the sum of its proper divisors (6883839897).
11211043431 is a wasteful number, since it uses less digits than its factorization.
11211043431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11271.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11211043431 its reverse (13434011211), we get a palindrome (24645054642).
The spelling of 11211043431 in words is "eleven billion, two hundred eleven million, forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •