Base | Representation |
---|---|
bin | 10010111001100011… |
… | …00100100001101001 |
3 | 222012010022012121121 |
4 | 21130301210201221 |
5 | 131234441330004 |
6 | 4354453135241 |
7 | 506303154460 |
oct | 113461444151 |
9 | 28163265547 |
10 | 10146433129 |
11 | 4337440428 |
12 | 1b7202a521 |
13 | c5913a9b1 |
14 | 6c379d9d7 |
15 | 3e5b85854 |
hex | 25cc64869 |
10146433129 has 8 divisors (see below), whose sum is σ = 11604806208. Its totient is φ = 8690280720.
The previous prime is 10146433117. The next prime is 10146433133. The reversal of 10146433129 is 92133464101.
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 10146433129 - 27 = 10146433001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10146433094 and 10146433103.
It is not an unprimeable number, because it can be changed into a prime (10146436129) 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, 545362 + ... + 563659.
It is an arithmetic number, because the mean of its divisors is an integer number (1450600776).
Almost surely, 210146433129 is an apocalyptic number.
It is an amenable number.
10146433129 is a deficient number, since it is larger than the sum of its proper divisors (1458373079).
10146433129 is a wasteful number, since it uses less digits than its factorization.
10146433129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110335.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 10146433129 in words is "ten billion, one hundred forty-six million, four hundred thirty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •