Base | Representation |
---|---|
bin | 1010011010011110101110… |
… | …1011111101001000110101 |
3 | 1111112121120010002122211222 |
4 | 2212213223223331020311 |
5 | 3000044141223342323 |
6 | 40204024321440125 |
7 | 2261144500155560 |
oct | 246475353751065 |
9 | 44477503078758 |
10 | 11450042012213 |
11 | 3714a322397a2 |
12 | 134b117aa0045 |
13 | 6509714217bc |
14 | 2b82838834d7 |
15 | 14cc964959c8 |
hex | a69ebafd235 |
11450042012213 has 8 divisors (see below), whose sum is σ = 13220667066432. Its totient is φ = 9713143149696.
The previous prime is 11450042012203. The next prime is 11450042012221. The reversal of 11450042012213 is 31221024005411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11450042012213 - 24 = 11450042012197 is a prime.
It is a super-2 number, since 2×114500420122132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11450042012203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8431547195 + ... + 8431548552.
It is an arithmetic number, because the mean of its divisors is an integer number (1652583383304).
Almost surely, 211450042012213 is an apocalyptic number.
It is an amenable number.
11450042012213 is a deficient number, since it is larger than the sum of its proper divisors (1770625054219).
11450042012213 is an equidigital number, since it uses as much as digits as its factorization.
11450042012213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16863095851.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 11450042012213 its reverse (31221024005411), we get a palindrome (42671066017624).
The spelling of 11450042012213 in words is "eleven trillion, four hundred fifty billion, forty-two million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.218 sec. • engine limits •