Base | Representation |
---|---|
bin | 10010101110110110… |
… | …100100110101101001 |
3 | 1220220201221011111012 |
4 | 102232312210311221 |
5 | 312143013131213 |
6 | 13123500113305 |
7 | 1311300114323 |
oct | 225666446551 |
9 | 56821834435 |
10 | 20113411433 |
11 | 8591550785 |
12 | 3a93b35835 |
13 | 1b870359ab |
14 | d8b3a8613 |
15 | 7cabbe4a8 |
hex | 4aeda4d69 |
20113411433 has 16 divisors (see below), whose sum is σ = 21434777280. Its totient is φ = 18807599616.
The previous prime is 20113411421. The next prime is 20113411441. The reversal of 20113411433 is 33411431102.
It is a cyclic number.
It is not a de Polignac number, because 20113411433 - 28 = 20113411177 is a prime.
It is a super-2 number, since 2×201134114332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20113411399 and 20113411408.
It is not an unprimeable number, because it can be changed into a prime (20113411463) 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 15 ways as a sum of consecutive naturals, for example, 4510541 + ... + 4514997.
It is an arithmetic number, because the mean of its divisors is an integer number (1339673580).
Almost surely, 220113411433 is an apocalyptic number.
It is an amenable number.
20113411433 is a deficient number, since it is larger than the sum of its proper divisors (1321365847).
20113411433 is a wasteful number, since it uses less digits than its factorization.
20113411433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6136.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20113411433 its reverse (33411431102), we get a palindrome (53524842535).
The spelling of 20113411433 in words is "twenty billion, one hundred thirteen million, four hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •