Base | Representation |
---|---|
bin | 11101011001111000101… |
… | …11100000110011100001 |
3 | 10120120211122100110001012 |
4 | 32230330113200303201 |
5 | 113023124002024301 |
6 | 2052050024350305 |
7 | 132664631151215 |
oct | 16547427406341 |
9 | 3516748313035 |
10 | 1010330111201 |
11 | 35a52a010384 |
12 | 143985615395 |
13 | 74373497588 |
14 | 36c8637a945 |
15 | 1b4335ceebb |
hex | eb3c5e0ce1 |
1010330111201 has 4 divisors (see below), whose sum is σ = 1019599194900. Its totient is φ = 1001061027504.
The previous prime is 1010330111191. The next prime is 1010330111267. The reversal of 1010330111201 is 1021110330101.
It is a happy number.
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 568178258176 + 442151853025 = 753776^2 + 664945^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010330111201 - 26 = 1010330111137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010330114201) 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, 4634541686 + ... + 4634541903.
It is an arithmetic number, because the mean of its divisors is an integer number (254899798725).
Almost surely, 21010330111201 is an apocalyptic number.
It is an amenable number.
1010330111201 is a deficient number, since it is larger than the sum of its proper divisors (9269083699).
1010330111201 is an equidigital number, since it uses as much as digits as its factorization.
1010330111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9269083698.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1010330111201 its reverse (1021110330101), we get a palindrome (2031440441302).
The spelling of 1010330111201 in words is "one trillion, ten billion, three hundred thirty million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •