Base | Representation |
---|---|
bin | 1111110110110010110… |
… | …11000110101000100111 |
3 | 1221002020222222111202112 |
4 | 13323121123012220213 |
5 | 32411234242441411 |
6 | 1054141155031235 |
7 | 54234663350600 |
oct | 7733133065047 |
9 | 1832228874675 |
10 | 544813640231 |
11 | 1a0066107703 |
12 | 89708b9b51b |
13 | 3c4b656c363 |
14 | 1c524c20da7 |
15 | e28a00db8b |
hex | 7ed96c6a27 |
544813640231 has 6 divisors (see below), whose sum is σ = 633762806040. Its totient is φ = 466983120156.
The previous prime is 544813640227. The next prime is 544813640243. The reversal of 544813640231 is 132046318445.
It is not a de Polignac number, because 544813640231 - 22 = 544813640227 is a prime.
It is a super-3 number, since 3×5448136402313 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (544813640131) 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 5 ways as a sum of consecutive naturals, for example, 5559322811 + ... + 5559322908.
It is an arithmetic number, because the mean of its divisors is an integer number (105627134340).
Almost surely, 2544813640231 is an apocalyptic number.
544813640231 is a deficient number, since it is larger than the sum of its proper divisors (88949165809).
544813640231 is a wasteful number, since it uses less digits than its factorization.
544813640231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11118645733 (or 11118645726 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 41.
Adding to 544813640231 its reverse (132046318445), we get a palindrome (676859958676).
The spelling of 544813640231 in words is "five hundred forty-four billion, eight hundred thirteen million, six hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •