Base | Representation |
---|---|
bin | 111110111111111111001110… |
… | …1101101100111000100011111 |
3 | 2200200002102201102001110021202 |
4 | 1331333332131231213010133 |
5 | 1040113212212110124411 |
6 | 5242330002251550115 |
7 | 224503114251300356 |
oct | 17577763555470437 |
9 | 2620072642043252 |
10 | 554152211411231 |
11 | 15062a6a6694664 |
12 | 5219a4b245b33b |
13 | 1aa2943865a1a4 |
14 | 9abb17832299d |
15 | 440eb8631a83b |
hex | 1f7ff9db6711f |
554152211411231 has 32 divisors (see below), whose sum is σ = 618134020977600. Its totient is φ = 493702417612800.
The previous prime is 554152211411221. The next prime is 554152211411251. The reversal of 554152211411231 is 132114112251455.
It is a cyclic number.
It is not a de Polignac number, because 554152211411231 - 234 = 554135031542047 is a prime.
It is a super-2 number, since 2×5541522114112312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (554152211411221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2799087815 + ... + 2799285783.
It is an arithmetic number, because the mean of its divisors is an integer number (19316688155550).
Almost surely, 2554152211411231 is an apocalyptic number.
554152211411231 is a deficient number, since it is larger than the sum of its proper divisors (63981809566369).
554152211411231 is a wasteful number, since it uses less digits than its factorization.
554152211411231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205019.
The product of its digits is 48000, while the sum is 38.
Adding to 554152211411231 its reverse (132114112251455), we get a palindrome (686266323662686).
The spelling of 554152211411231 in words is "five hundred fifty-four trillion, one hundred fifty-two billion, two hundred eleven million, four hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •