Base | Representation |
---|---|
bin | 101000011010111111… |
… | …001001011001100111 |
3 | 11011000210100002201011 |
4 | 220122333021121213 |
5 | 1202342010343101 |
6 | 31534440443051 |
7 | 3064360413616 |
oct | 503277113147 |
9 | 134023302634 |
10 | 43402434151 |
11 | 174525a719a |
12 | 84b3479487 |
13 | 4128c4b2cb |
14 | 215a40d87d |
15 | 11e0570751 |
hex | a1afc9667 |
43402434151 has 4 divisors (see below), whose sum is σ = 44802512704. Its totient is φ = 42002355600.
The previous prime is 43402434139. The next prime is 43402434199. The reversal of 43402434151 is 15143420434.
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 43402434151 - 223 = 43394045543 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 1400078521 = 43402434151 / (4 + 3 + 4 + 0 + 2 + 4 + 3 + 4 + 1 + 5 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43402431151) 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, 700039230 + ... + 700039291.
It is an arithmetic number, because the mean of its divisors is an integer number (11200628176).
Almost surely, 243402434151 is an apocalyptic number.
43402434151 is a deficient number, since it is larger than the sum of its proper divisors (1400078553).
43402434151 is a wasteful number, since it uses less digits than its factorization.
43402434151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1400078552.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 43402434151 its reverse (15143420434), we get a palindrome (58545854585).
The spelling of 43402434151 in words is "forty-three billion, four hundred two million, four hundred thirty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •