Base | Representation |
---|---|
bin | 1001001101110001000110… |
… | …0110010010110011101001 |
3 | 1022212121210002011021110221 |
4 | 2103130101212102303221 |
5 | 2312001042003234231 |
6 | 33314344425410041 |
7 | 2064010312235554 |
oct | 223342146226351 |
9 | 38777702137427 |
10 | 10132123102441 |
11 | 325701139046a |
12 | 117780b639921 |
13 | 5865bbb49492 |
14 | 27057c57969b |
15 | 12885e383d11 |
hex | 93711992ce9 |
10132123102441 has 4 divisors (see below), whose sum is σ = 10192794498432. Its totient is φ = 10071451706452.
The previous prime is 10132123102427. The next prime is 10132123102483. The reversal of 10132123102441 is 14420132123101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10132123102441 - 239 = 9582367288553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132123102741) 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, 30335697745 + ... + 30335698078.
It is an arithmetic number, because the mean of its divisors is an integer number (2548198624608).
Almost surely, 210132123102441 is an apocalyptic number.
It is an amenable number.
10132123102441 is a deficient number, since it is larger than the sum of its proper divisors (60671395991).
10132123102441 is an equidigital number, since it uses as much as digits as its factorization.
10132123102441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60671395990.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 10132123102441 its reverse (14420132123101), we get a palindrome (24552255225542).
The spelling of 10132123102441 in words is "ten trillion, one hundred thirty-two billion, one hundred twenty-three million, one hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •