Base | Representation |
---|---|
bin | 11110000110101111110… |
… | …10010110111111101101 |
3 | 10122220000010110202101211 |
4 | 33003113322112333231 |
5 | 113421440111113041 |
6 | 2111111541434421 |
7 | 134506520416015 |
oct | 17032772267755 |
9 | 3586003422354 |
10 | 1034414551021 |
11 | 3697690574a5 |
12 | 14858740ba11 |
13 | 76711119ab7 |
14 | 380cccb6c45 |
15 | 1bd92c00481 |
hex | f0d7e96fed |
1034414551021 has 4 divisors (see below), whose sum is σ = 1035473318172. Its totient is φ = 1033355783872.
The previous prime is 1034414550997. The next prime is 1034414551081. The reversal of 1034414551021 is 1201554144301.
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 903649866025 + 130764684996 = 950605^2 + 361614^2 .
It is a cyclic number.
It is not a de Polignac number, because 1034414551021 - 217 = 1034414419949 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 (1034414551081) 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, 529382110 + ... + 529384063.
It is an arithmetic number, because the mean of its divisors is an integer number (258868329543).
Almost surely, 21034414551021 is an apocalyptic number.
It is an amenable number.
1034414551021 is a deficient number, since it is larger than the sum of its proper divisors (1058767151).
1034414551021 is an equidigital number, since it uses as much as digits as its factorization.
1034414551021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1058767150.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 1034414551021 its reverse (1201554144301), we get a palindrome (2235968695322).
The spelling of 1034414551021 in words is "one trillion, thirty-four billion, four hundred fourteen million, five hundred fifty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •