Base | Representation |
---|---|
bin | 1001011111001111110111… |
… | …1001001111000010001001 |
3 | 1100221022221200211021002211 |
4 | 2113303331321033002021 |
5 | 2331411114144442441 |
6 | 34104332532025121 |
7 | 2124501410602333 |
oct | 227637571170211 |
9 | 40838850737084 |
10 | 10432440234121 |
11 | 33624115a2464 |
12 | 1205a631621a1 |
13 | 5a8a0c593869 |
14 | 280d0b870453 |
15 | 1315897d7a81 |
hex | 97cfde4f089 |
10432440234121 has 4 divisors (see below), whose sum is σ = 10448973420544. Its totient is φ = 10415907047700.
The previous prime is 10432440234119. The next prime is 10432440234127. The reversal of 10432440234121 is 12143204423401.
It is a happy number.
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 10432440234121 - 21 = 10432440234119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10432440234127) 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, 8266592265 + ... + 8266593526.
It is an arithmetic number, because the mean of its divisors is an integer number (2612243355136).
Almost surely, 210432440234121 is an apocalyptic number.
It is an amenable number.
10432440234121 is a deficient number, since it is larger than the sum of its proper divisors (16533186423).
10432440234121 is an equidigital number, since it uses as much as digits as its factorization.
10432440234121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16533186422.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 10432440234121 its reverse (12143204423401), we get a palindrome (22575644657522).
The spelling of 10432440234121 in words is "ten trillion, four hundred thirty-two billion, four hundred forty million, two hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •