Base | Representation |
---|---|
bin | 101000001001101011… |
… | …101100010011001111 |
3 | 11010021120001200200122 |
4 | 220021223230103033 |
5 | 1201243200342201 |
6 | 31445550215155 |
7 | 3054233662322 |
oct | 501153542317 |
9 | 133246050618 |
10 | 43112121551 |
11 | 1731373a024 |
12 | 84321b44bb |
13 | 40b0a629c5 |
14 | 212da3c7b9 |
15 | 11c4d26e1b |
hex | a09aec4cf |
43112121551 has 8 divisors (see below), whose sum is σ = 46125135600. Its totient is φ = 40173503040.
The previous prime is 43112121529. The next prime is 43112121557. The reversal of 43112121551 is 15512121134.
43112121551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 43112121551 - 214 = 43112105167 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 43112121551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43112121557) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18597686 + ... + 18600003.
It is an arithmetic number, because the mean of its divisors is an integer number (5765641950).
Almost surely, 243112121551 is an apocalyptic number.
43112121551 is a deficient number, since it is larger than the sum of its proper divisors (3013014049).
43112121551 is a wasteful number, since it uses less digits than its factorization.
43112121551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37197769.
The product of its digits is 1200, while the sum is 26.
Adding to 43112121551 its reverse (15512121134), we get a palindrome (58624242685).
The spelling of 43112121551 in words is "forty-three billion, one hundred twelve million, one hundred twenty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •