Base | Representation |
---|---|
bin | 1111101101110110101… |
… | …00101000111101100010 |
3 | 1220121212110222100112212 |
4 | 13312323110220331202 |
5 | 32321421444141200 |
6 | 1052025010522122 |
7 | 54005020251242 |
oct | 7667324507542 |
9 | 1817773870485 |
10 | 540013662050 |
11 | 1990226a7a95 |
12 | 887a9596342 |
13 | 3bbccca4995 |
14 | 1c1cb549b22 |
15 | e0a8918035 |
hex | 7dbb528f62 |
540013662050 has 24 divisors (see below), whose sum is σ = 1036826234112. Its totient is φ = 209037546000.
The previous prime is 540013662037. The next prime is 540013662059. The reversal of 540013662050 is 50266310045.
It is a super-2 number, since 2×5400136620502 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 540013661998 and 540013662016.
It is not an unprimeable number, because it can be changed into a prime (540013662059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 174196406 + ... + 174199505.
It is an arithmetic number, because the mean of its divisors is an integer number (43201093088).
Almost surely, 2540013662050 is an apocalyptic number.
540013662050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
540013662050 is a deficient number, since it is larger than the sum of its proper divisors (496812572062).
540013662050 is a wasteful number, since it uses less digits than its factorization.
540013662050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348395954 (or 348395949 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 540013662050 its reverse (50266310045), we get a palindrome (590279972095).
The spelling of 540013662050 in words is "five hundred forty billion, thirteen million, six hundred sixty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •