Base | Representation |
---|---|
bin | 1111110111100111000… |
… | …11110010100111010101 |
3 | 1221010101120001211222101 |
4 | 13323303203302213111 |
5 | 32413134021001031 |
6 | 1054252501202101 |
7 | 54251566410343 |
oct | 7736343624725 |
9 | 1833346054871 |
10 | 545252125141 |
11 | 1a0270678929 |
12 | 8980ba00331 |
13 | 3c556366999 |
14 | 1c567162993 |
15 | e2b3775361 |
hex | 7ef38f29d5 |
545252125141 has 4 divisors (see below), whose sum is σ = 545261329152. Its totient is φ = 545242921132.
The previous prime is 545252125133. The next prime is 545252125147. The reversal of 545252125141 is 141521252545.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 545252125141 - 23 = 545252125133 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 545252125141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (545252125147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4512565 + ... + 4631818.
It is an arithmetic number, because the mean of its divisors is an integer number (136315332288).
Almost surely, 2545252125141 is an apocalyptic number.
It is an amenable number.
545252125141 is a deficient number, since it is larger than the sum of its proper divisors (9204011).
545252125141 is an equidigital number, since it uses as much as digits as its factorization.
545252125141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9204010.
The product of its digits is 80000, while the sum is 37.
Adding to 545252125141 its reverse (141521252545), we get a palindrome (686773377686).
The spelling of 545252125141 in words is "five hundred forty-five billion, two hundred fifty-two million, one hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •