Base | Representation |
---|---|
bin | 11110010101000110100… |
… | …00111010001001010111 |
3 | 10200121220012220022021011 |
4 | 33022203100322021113 |
5 | 114033231012014221 |
6 | 2114424402033051 |
7 | 135201510036655 |
oct | 17124320721127 |
9 | 3617805808234 |
10 | 1042121204311 |
11 | 371a63285150 |
12 | 149b78348787 |
13 | 7736b951585 |
14 | 3862061ddd5 |
15 | 1c1945a31e1 |
hex | f2a343a257 |
1042121204311 has 16 divisors (see below), whose sum is σ = 1158041622528. Its totient is φ = 929850818400.
The previous prime is 1042121204297. The next prime is 1042121204323. The reversal of 1042121204311 is 1134021212401.
1042121204311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1042121204311 - 215 = 1042121171543 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 (1042121204611) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2817636 + ... + 3165961.
It is an arithmetic number, because the mean of its divisors is an integer number (72377601408).
Almost surely, 21042121204311 is an apocalyptic number.
1042121204311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1042121204311 is a deficient number, since it is larger than the sum of its proper divisors (115920418217).
1042121204311 is a wasteful number, since it uses less digits than its factorization.
1042121204311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5983902.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 1042121204311 its reverse (1134021212401), we get a palindrome (2176142416712).
The spelling of 1042121204311 in words is "one trillion, forty-two billion, one hundred twenty-one million, two hundred four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •