Base | Representation |
---|---|
bin | 11110000111000000101… |
… | …00001010111100010001 |
3 | 10122220100221202111020011 |
4 | 33003200110022330101 |
5 | 113422232204110441 |
6 | 2111133535314521 |
7 | 134513151645253 |
oct | 17034024127421 |
9 | 3586327674204 |
10 | 1034555535121 |
11 | 3698306a0989 |
12 | 14860667ba41 |
13 | 767343b0044 |
14 | 381038d5cd3 |
15 | 1bda029d581 |
hex | f0e050af11 |
1034555535121 has 8 divisors (see below), whose sum is σ = 1054568816424. Its totient is φ = 1014560526720.
The previous prime is 1034555535029. The next prime is 1034555535131. The reversal of 1034555535121 is 1215355554301.
It can be written as a sum of positive squares in 4 ways, for example, as 866478096 + 1033689057025 = 29436^2 + 1016705^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1034555535121 - 217 = 1034555404049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1034555535131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4453870 + ... + 4680391.
It is an arithmetic number, because the mean of its divisors is an integer number (131821102053).
Almost surely, 21034555535121 is an apocalyptic number.
It is an amenable number.
1034555535121 is a deficient number, since it is larger than the sum of its proper divisors (20013281303).
1034555535121 is an equidigital number, since it uses as much as digits as its factorization.
1034555535121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9136451.
The product of its (nonzero) digits is 225000, while the sum is 40.
The spelling of 1034555535121 in words is "one trillion, thirty-four billion, five hundred fifty-five million, five hundred thirty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •