Base | Representation |
---|---|
bin | 10011100111000111100010… |
… | …00000101110110010101001 |
3 | 12122200202111022002200021102 |
4 | 21303203301000232302221 |
5 | 21123032023334340203 |
6 | 231415331013051145 |
7 | 12040500316354151 |
oct | 1163436100566251 |
9 | 178622438080242 |
10 | 43125515152553 |
11 | 12817479029689 |
12 | 4a0601b926ab5 |
13 | 1b0a945a9c5b2 |
14 | a91400d97761 |
15 | 4ebbd86ca888 |
hex | 2738f102eca9 |
43125515152553 has 4 divisors (see below), whose sum is σ = 43183871736720. Its totient is φ = 43067158568388.
The previous prime is 43125515152537. The next prime is 43125515152583. The reversal of 43125515152553 is 35525151552134.
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 43125515152553 - 24 = 43125515152537 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 43125515152498 and 43125515152507.
It is not an unprimeable number, because it can be changed into a prime (43125515152583) 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, 29178290975 + ... + 29178292452.
It is an arithmetic number, because the mean of its divisors is an integer number (10795967934180).
Almost surely, 243125515152553 is an apocalyptic number.
It is an amenable number.
43125515152553 is a deficient number, since it is larger than the sum of its proper divisors (58356584167).
43125515152553 is an equidigital number, since it uses as much as digits as its factorization.
43125515152553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58356584166.
The product of its digits is 2250000, while the sum is 47.
The spelling of 43125515152553 in words is "forty-three trillion, one hundred twenty-five billion, five hundred fifteen million, one hundred fifty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.207 sec. • engine limits •