Base | Representation |
---|---|
bin | 1001011001011010100100… |
… | …0001101000011011000110 |
3 | 1100120202022000120211120122 |
4 | 2112112221001220123012 |
5 | 2323240402410432402 |
6 | 33550321212301542 |
7 | 2114323225661150 |
oct | 226265101503306 |
9 | 40522260524518 |
10 | 10332232124102 |
11 | 3323969745209 |
12 | 11aa5577718b2 |
13 | 59c42c91a5c5 |
14 | 27a122d19ad0 |
15 | 12db72190ca2 |
hex | 965a90686c6 |
10332232124102 has 8 divisors (see below), whose sum is σ = 17712397927056. Its totient is φ = 4428099481752.
The previous prime is 10332232124101. The next prime is 10332232124143. The reversal of 10332232124102 is 20142123223301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×103322321241023 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10332232124101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 369008290133 + ... + 369008290160.
It is an arithmetic number, because the mean of its divisors is an integer number (2214049740882).
Almost surely, 210332232124102 is an apocalyptic number.
10332232124102 is a deficient number, since it is larger than the sum of its proper divisors (7380165802954).
10332232124102 is an equidigital number, since it uses as much as digits as its factorization.
10332232124102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738016580302.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 10332232124102 its reverse (20142123223301), we get a palindrome (30474355347403).
The spelling of 10332232124102 in words is "ten trillion, three hundred thirty-two billion, two hundred thirty-two million, one hundred twenty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •