Base | Representation |
---|---|
bin | 11110010011100110011… |
… | …11100101011110001001 |
3 | 10200112211001220212211211 |
4 | 33021303033211132021 |
5 | 114030103240113423 |
6 | 2114212422053121 |
7 | 135142525066555 |
oct | 17116317453611 |
9 | 3615731825754 |
10 | 1041315551113 |
11 | 37168a532a62 |
12 | 14999257a1a1 |
13 | 77270a6c4c6 |
14 | 38585622865 |
15 | 1c1489b110d |
hex | f2733e5789 |
1041315551113 has 4 divisors (see below), whose sum is σ = 1077222983940. Its totient is φ = 1005408118288.
The previous prime is 1041315551093. The next prime is 1041315551153. The reversal of 1041315551113 is 3111555131401.
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 808655958009 + 232659593104 = 899253^2 + 482348^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041315551113 - 213 = 1041315542921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1041315551153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17953716370 + ... + 17953716427.
It is an arithmetic number, because the mean of its divisors is an integer number (269305745985).
Almost surely, 21041315551113 is an apocalyptic number.
It is an amenable number.
1041315551113 is a deficient number, since it is larger than the sum of its proper divisors (35907432827).
1041315551113 is an equidigital number, since it uses as much as digits as its factorization.
1041315551113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35907432826.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 1041315551113 in words is "one trillion, forty-one billion, three hundred fifteen million, five hundred fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •