Base | Representation |
---|---|
bin | 10000000010101111001… |
… | …001000101101111110101 |
3 | 10220101121122012212000122 |
4 | 100002233021011233311 |
5 | 121030304201222123 |
6 | 2202243014021325 |
7 | 142435511403644 |
oct | 20025711055765 |
9 | 3811548185018 |
10 | 1102450023413 |
11 | 39560132a932 |
12 | 1597b4347845 |
13 | 7cc64559b7b |
14 | 3b504a2935b |
15 | 1da25b08bc8 |
hex | 100af245bf5 |
1102450023413 has 4 divisors (see below), whose sum is σ = 1102566116940. Its totient is φ = 1102333929888.
The previous prime is 1102450023407. The next prime is 1102450023439. The reversal of 1102450023413 is 3143200542011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 266774316004 + 835675707409 = 516502^2 + 914153^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102450023413 - 24 = 1102450023397 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 (1102450023463) 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, 58032518 + ... + 58051511.
It is an arithmetic number, because the mean of its divisors is an integer number (275641529235).
Almost surely, 21102450023413 is an apocalyptic number.
It is an amenable number.
1102450023413 is a deficient number, since it is larger than the sum of its proper divisors (116093527).
1102450023413 is an equidigital number, since it uses as much as digits as its factorization.
1102450023413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116093526.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 1102450023413 its reverse (3143200542011), we get a palindrome (4245650565424).
The spelling of 1102450023413 in words is "one trillion, one hundred two billion, four hundred fifty million, twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •