Base | Representation |
---|---|
bin | 10000000100010111100… |
… | …001011110000101100111 |
3 | 10220120010200110010110120 |
4 | 100010113201132011213 |
5 | 121042401004320111 |
6 | 2203132452453023 |
7 | 142530064502223 |
oct | 20042741360547 |
9 | 3816120403416 |
10 | 1104201245031 |
11 | 39631a8a8625 |
12 | 15a00291a173 |
13 | 801832cb891 |
14 | 3b62d445783 |
15 | 1dac9729406 |
hex | 1011785e167 |
1104201245031 has 8 divisors (see below), whose sum is σ = 1519760853504. Its totient is φ = 712387899960.
The previous prime is 1104201244961. The next prime is 1104201245083. The reversal of 1104201245031 is 1305421024011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1104201245031 - 27 = 1104201244903 is a prime.
It is a super-2 number, since 2×11042012450312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1104201244992 and 1104201245010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104201245431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5936565741 + ... + 5936565926.
It is an arithmetic number, because the mean of its divisors is an integer number (189970106688).
Almost surely, 21104201245031 is an apocalyptic number.
1104201245031 is a deficient number, since it is larger than the sum of its proper divisors (415559608473).
1104201245031 is a wasteful number, since it uses less digits than its factorization.
1104201245031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11873131701.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 1104201245031 its reverse (1305421024011), we get a palindrome (2409622269042).
The spelling of 1104201245031 in words is "one trillion, one hundred four billion, two hundred one million, two hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •