Base | Representation |
---|---|
bin | 10100100001110110… |
… | …10110110011110111 |
3 | 1001110002201211012120 |
4 | 22100323112303313 |
5 | 140032440213443 |
6 | 5021351051023 |
7 | 540056320143 |
oct | 122073266367 |
9 | 31402654176 |
10 | 11021413623 |
11 | 4746334200 |
12 | 2177070a73 |
13 | 10684b432c |
14 | 767a86223 |
15 | 4478be083 |
hex | 290ed6cf7 |
11021413623 has 12 divisors (see below), whose sum is σ = 16152595704. Its totient is φ = 6679644400.
The previous prime is 11021413621. The next prime is 11021413643. The reversal of 11021413623 is 32631412011.
It is a happy number.
It is not a de Polignac number, because 11021413623 - 21 = 11021413621 is a prime.
It is a super-2 number, since 2×110214136232 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (24) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 11021413593 and 11021413602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021413621) 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, 15180648 + ... + 15181373.
It is an arithmetic number, because the mean of its divisors is an integer number (1346049642).
Almost surely, 211021413623 is an apocalyptic number.
11021413623 is a deficient number, since it is larger than the sum of its proper divisors (5131182081).
11021413623 is a wasteful number, since it uses less digits than its factorization.
11021413623 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30362046 (or 30362035 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 11021413623 its reverse (32631412011), we get a palindrome (43652825634).
The spelling of 11021413623 in words is "eleven billion, twenty-one million, four hundred thirteen thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •