Base | Representation |
---|---|
bin | 11101011110100011101… |
… | …00000100010101010101 |
3 | 10120211022101021000100012 |
4 | 32233101310010111111 |
5 | 113043242333330231 |
6 | 2053142512330005 |
7 | 133114024603601 |
oct | 16572164042525 |
9 | 3524271230305 |
10 | 1012837401941 |
11 | 3605a6343a92 |
12 | 144365243905 |
13 | 74682a7a371 |
14 | 37043368501 |
15 | 1b52d79ae2b |
hex | ebd1d04555 |
1012837401941 has 2 divisors, whose sum is σ = 1012837401942. Its totient is φ = 1012837401940.
The previous prime is 1012837401899. The next prime is 1012837401959. The reversal of 1012837401941 is 1491047382101.
1012837401941 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 998308715716 + 14528686225 = 999154^2 + 120535^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012837401941 - 214 = 1012837385557 is a prime.
It is a super-4 number, since 4×10128374019414 (a number of 49 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012837401971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506418700970 + 506418700971.
It is an arithmetic number, because the mean of its divisors is an integer number (506418700971).
Almost surely, 21012837401941 is an apocalyptic number.
It is an amenable number.
1012837401941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012837401941 is an equidigital number, since it uses as much as digits as its factorization.
1012837401941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48384, while the sum is 41.
The spelling of 1012837401941 in words is "one trillion, twelve billion, eight hundred thirty-seven million, four hundred one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •