Base | Representation |
---|---|
bin | 111100010000011… |
… | …111101000000001 |
3 | 2121110021221000111 |
4 | 330100133220001 |
5 | 4032301104201 |
6 | 244152151321 |
7 | 34023663631 |
oct | 7420375001 |
9 | 2543257014 |
10 | 1010956801 |
11 | 479727898 |
12 | 242698541 |
13 | 1315a53ba |
14 | 983a06c1 |
15 | 5db47b51 |
hex | 3c41fa01 |
1010956801 has 4 divisors (see below), whose sum is σ = 1011052612. Its totient is φ = 1010860992.
The previous prime is 1010956787. The next prime is 1010956829. The reversal of 1010956801 is 1086590101.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 109516225 + 901440576 = 10465^2 + 30024^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010956801 - 27 = 1010956673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010956861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29796 + ... + 53941.
It is an arithmetic number, because the mean of its divisors is an integer number (252763153).
Almost surely, 21010956801 is an apocalyptic number.
It is an amenable number.
1010956801 is a deficient number, since it is larger than the sum of its proper divisors (95811).
1010956801 is an equidigital number, since it uses as much as digits as its factorization.
1010956801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95810.
The product of its (nonzero) digits is 2160, while the sum is 31.
The square root of 1010956801 is about 31795.5468737369. The cubic root of 1010956801 is about 1003.6390085537.
The spelling of 1010956801 in words is "one billion, ten million, nine hundred fifty-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •