Base | Representation |
---|---|
bin | 10000110100011101… |
… | …00011011000010101 |
3 | 212022022110100111002 |
4 | 20122032203120111 |
5 | 121443132112031 |
6 | 4052011153045 |
7 | 436525240442 |
oct | 103216433025 |
9 | 25268410432 |
10 | 9029957141 |
11 | 39141a24a7 |
12 | 1900145785 |
13 | b0ba3b90a |
14 | 6193b29c9 |
15 | 37cb47ccb |
hex | 21a3a3615 |
9029957141 has 4 divisors (see below), whose sum is σ = 9030323532. Its totient is φ = 9029590752.
The previous prime is 9029957117. The next prime is 9029957143. The reversal of 9029957141 is 1417599209.
9029957141 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 7937919025 + 1092038116 = 89095^2 + 33046^2 .
It is a cyclic number.
It is not a de Polignac number, because 9029957141 - 226 = 8962848277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9029957143) 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, 143336 + ... + 196481.
It is an arithmetic number, because the mean of its divisors is an integer number (2257580883).
Almost surely, 29029957141 is an apocalyptic number.
It is an amenable number.
9029957141 is a deficient number, since it is larger than the sum of its proper divisors (366391).
9029957141 is a wasteful number, since it uses less digits than its factorization.
9029957141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366390.
The product of its (nonzero) digits is 204120, while the sum is 47.
The square root of 9029957141 is about 95026.0866341448. The cubic root of 9029957141 is about 2082.3891694886.
The spelling of 9029957141 in words is "nine billion, twenty-nine million, nine hundred fifty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •