Base | Representation |
---|---|
bin | 11110010011101000100… |
… | …10001100111000010011 |
3 | 10200112212021210002110201 |
4 | 33021310102030320103 |
5 | 114030122222422120 |
6 | 2114214244240031 |
7 | 135143126401066 |
oct | 17116422147023 |
9 | 3615767702421 |
10 | 1041333014035 |
11 | 371699380126 |
12 | 1499983a0017 |
13 | 77274574bb2 |
14 | 38587a8a8dd |
15 | 1c14a2b040a |
hex | f27448ce13 |
1041333014035 has 8 divisors (see below), whose sum is σ = 1249606241856. Its totient is φ = 833061994560.
The previous prime is 1041333014023. The next prime is 1041333014093. The reversal of 1041333014035 is 5304103331401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1041333014035 - 227 = 1041198796307 is a prime.
It is a super-2 number, since 2×10413330140352 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1041333013994 and 1041333014012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 775567 + ... + 1638343.
It is an arithmetic number, because the mean of its divisors is an integer number (156200780232).
Almost surely, 21041333014035 is an apocalyptic number.
1041333014035 is a deficient number, since it is larger than the sum of its proper divisors (208273227821).
1041333014035 is an equidigital number, since it uses as much as digits as its factorization.
1041333014035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1104173.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 1041333014035 its reverse (5304103331401), we get a palindrome (6345436345436).
The spelling of 1041333014035 in words is "one trillion, forty-one billion, three hundred thirty-three million, fourteen thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •