Base | Representation |
---|---|
bin | 10011001110011010… |
… | …00111001101010001 |
3 | 222122022120201122122 |
4 | 21213031013031101 |
5 | 132114241101413 |
6 | 4424103544025 |
7 | 513526444520 |
oct | 114715071521 |
9 | 28568521578 |
10 | 10321425233 |
11 | 44171a25a9 |
12 | 200075b015 |
13 | c8647a312 |
14 | 6dcb124b7 |
15 | 406200108 |
hex | 267347351 |
10321425233 has 8 divisors (see below), whose sum is σ = 12416752320. Its totient is φ = 8381307600.
The previous prime is 10321425223. The next prime is 10321425307. The reversal of 10321425233 is 33252412301.
It is a happy number.
10321425233 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 10321425233 - 212 = 10321421137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10321425223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38802218 + ... + 38802483.
It is an arithmetic number, because the mean of its divisors is an integer number (1552094040).
Almost surely, 210321425233 is an apocalyptic number.
It is an amenable number.
10321425233 is a deficient number, since it is larger than the sum of its proper divisors (2095327087).
10321425233 is an equidigital number, since it uses as much as digits as its factorization.
10321425233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77604727.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 10321425233 its reverse (33252412301), we get a palindrome (43573837534).
The spelling of 10321425233 in words is "ten billion, three hundred twenty-one million, four hundred twenty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •