Base | Representation |
---|---|
bin | 101000000111111100111… |
… | …1001011001010000011011 |
3 | 201112012020102211000122021 |
4 | 1100033321321121100123 |
5 | 1210322433204110321 |
6 | 15421215535435311 |
7 | 1106263545204004 |
oct | 120177171312033 |
9 | 21465212730567 |
10 | 5514635613211 |
11 | 183682004586a |
12 | 750934385b37 |
13 | 3100494086aa |
14 | 150ca465a1ab |
15 | 986ad18c941 |
hex | 503f9e5941b |
5514635613211 has 8 divisors (see below), whose sum is σ = 5515887500064. Its totient is φ = 5513383881600.
The previous prime is 5514635613197. The next prime is 5514635613241. The reversal of 5514635613211 is 1123165364155.
5514635613211 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5514635613211 - 219 = 5514635088923 is a prime.
It is a super-2 number, since 2×55146356132112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5514635613241) 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, 95832930 + ... + 95890456.
It is an arithmetic number, because the mean of its divisors is an integer number (689485937508).
Almost surely, 25514635613211 is an apocalyptic number.
5514635613211 is a deficient number, since it is larger than the sum of its proper divisors (1251886853).
5514635613211 is a wasteful number, since it uses less digits than its factorization.
5514635613211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77621.
The product of its digits is 324000, while the sum is 43.
The spelling of 5514635613211 in words is "five trillion, five hundred fourteen billion, six hundred thirty-five million, six hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •