Base | Representation |
---|---|
bin | 1100011111010001110… |
… | …10101101111111010101 |
3 | 1112000121101011121200112 |
4 | 12033220322231333111 |
5 | 24012304011003031 |
6 | 525044041052405 |
7 | 43000506206663 |
oct | 6175072557725 |
9 | 1460541147615 |
10 | 429109469141 |
11 | 155a91121411 |
12 | 6b1b7a87105 |
13 | 31607373ab2 |
14 | 16aaa237c33 |
15 | b26726662b |
hex | 63e8eadfd5 |
429109469141 has 4 divisors (see below), whose sum is σ = 429414019500. Its totient is φ = 428804918784.
The previous prime is 429109469123. The next prime is 429109469161. The reversal of 429109469141 is 141964901924.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 167318630116 + 261790839025 = 409046^2 + 511655^2 .
It is a cyclic number.
It is not a de Polignac number, because 429109469141 - 234 = 411929599957 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 429109469141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (429109469111) 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, 152273066 + ... + 152275883.
It is an arithmetic number, because the mean of its divisors is an integer number (107353504875).
Almost surely, 2429109469141 is an apocalyptic number.
It is an amenable number.
429109469141 is a deficient number, since it is larger than the sum of its proper divisors (304550359).
429109469141 is a wasteful number, since it uses less digits than its factorization.
429109469141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304550358.
The product of its (nonzero) digits is 559872, while the sum is 50.
The spelling of 429109469141 in words is "four hundred twenty-nine billion, one hundred nine million, four hundred sixty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •