Base | Representation |
---|---|
bin | 11101110111011110000… |
… | …01010000101001011001 |
3 | 10122002211111111022011212 |
4 | 32323233001100221121 |
5 | 113303140322121101 |
6 | 2103234015032505 |
7 | 134066332431560 |
oct | 16735701205131 |
9 | 3562744438155 |
10 | 1026212301401 |
11 | 36623a0aaa01 |
12 | 146a7850b735 |
13 | 75a04a12761 |
14 | 37951802bd7 |
15 | 1ba62aa41bb |
hex | eeef050a59 |
1026212301401 has 4 divisors (see below), whose sum is σ = 1172814058752. Its totient is φ = 879610544052.
The previous prime is 1026212301391. The next prime is 1026212301431. The reversal of 1026212301401 is 1041032126201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1026212301401 - 234 = 1009032432217 is a prime.
It is a super-2 number, since 2×10262123014012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1026212301431) 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, 73300878665 + ... + 73300878678.
It is an arithmetic number, because the mean of its divisors is an integer number (293203514688).
Almost surely, 21026212301401 is an apocalyptic number.
It is an amenable number.
1026212301401 is a deficient number, since it is larger than the sum of its proper divisors (146601757351).
1026212301401 is an equidigital number, since it uses as much as digits as its factorization.
1026212301401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146601757350.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1026212301401 its reverse (1041032126201), we get a palindrome (2067244427602).
The spelling of 1026212301401 in words is "one trillion, twenty-six billion, two hundred twelve million, three hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •