Base | Representation |
---|---|
bin | 1111110111001110010… |
… | …11000001100100110111 |
3 | 1221002212002000120000201 |
4 | 13323213023001210313 |
5 | 32412222320244411 |
6 | 1054220115021331 |
7 | 54243464106325 |
oct | 7734713014467 |
9 | 1832762016021 |
10 | 545044306231 |
11 | 1a0174335467 |
12 | 8977229a847 |
13 | 3c5222a2809 |
14 | 1c547706d15 |
15 | e2a03c43c1 |
hex | 7ee72c1937 |
545044306231 has 4 divisors (see below), whose sum is σ = 545209124872. Its totient is φ = 544879487592.
The previous prime is 545044306217. The next prime is 545044306267. The reversal of 545044306231 is 132603440545.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 545044306231 - 211 = 545044304183 is a prime.
It is a super-2 number, since 2×5450443062312 (a number of 24 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 (545044306291) 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 3 ways as a sum of consecutive naturals, for example, 82404360 + ... + 82410973.
It is an arithmetic number, because the mean of its divisors is an integer number (136302281218).
Almost surely, 2545044306231 is an apocalyptic number.
545044306231 is a deficient number, since it is larger than the sum of its proper divisors (164818641).
545044306231 is a wasteful number, since it uses less digits than its factorization.
545044306231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164818640.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 545044306231 its reverse (132603440545), we get a palindrome (677647746776).
The spelling of 545044306231 in words is "five hundred forty-five billion, forty-four million, three hundred six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •