Base | Representation |
---|---|
bin | 1001000111111101101001… |
… | …0011101110100011001101 |
3 | 1022112002101222200212112212 |
4 | 2101333122103232203031 |
5 | 2303332334234200103 |
6 | 33200454234240205 |
7 | 2053550334344264 |
oct | 221773223564315 |
9 | 38462358625485 |
10 | 10032411240653 |
11 | 32187a366791a |
12 | 1160422286065 |
13 | 57a08ac43729 |
14 | 2697dd8c15db |
15 | 125e755b37d8 |
hex | 91fda4ee8cd |
10032411240653 has 4 divisors (see below), whose sum is σ = 10032641432928. Its totient is φ = 10032181048380.
The previous prime is 10032411240647. The next prime is 10032411240689. The reversal of 10032411240653 is 35604211423001.
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 10032411240653 - 218 = 10032410978509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10032411240353) 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, 115030751 + ... + 115117932.
It is an arithmetic number, because the mean of its divisors is an integer number (2508160358232).
Almost surely, 210032411240653 is an apocalyptic number.
It is an amenable number.
10032411240653 is a deficient number, since it is larger than the sum of its proper divisors (230192275).
10032411240653 is an equidigital number, since it uses as much as digits as its factorization.
10032411240653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230192274.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 10032411240653 its reverse (35604211423001), we get a palindrome (45636622663654).
The spelling of 10032411240653 in words is "ten trillion, thirty-two billion, four hundred eleven million, two hundred forty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •