Base | Representation |
---|---|
bin | 11101011001110111110… |
… | …00100100100010000001 |
3 | 10120120211002002100120101 |
4 | 32230323320210202001 |
5 | 113023114413000001 |
6 | 2052045134442401 |
7 | 132664502206336 |
oct | 16547370444201 |
9 | 3516732070511 |
10 | 1010322000001 |
11 | 35a525480306 |
12 | 143982963401 |
13 | 743718b7652 |
14 | 36c8526898d |
15 | 1b432a2ba01 |
hex | eb3be24881 |
1010322000001 has 4 divisors (see below), whose sum is σ = 1014347187504. Its totient is φ = 1006296812500.
The previous prime is 1010321999993. The next prime is 1010322000013. The reversal of 1010322000001 is 1000002230101.
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 1010322000001 - 23 = 1010321999993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010322000031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2012593375 + ... + 2012593876.
It is an arithmetic number, because the mean of its divisors is an integer number (253586796876).
Almost surely, 21010322000001 is an apocalyptic number.
It is an amenable number.
1010322000001 is a deficient number, since it is larger than the sum of its proper divisors (4025187503).
1010322000001 is an equidigital number, since it uses as much as digits as its factorization.
1010322000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4025187502.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 1010322000001 its reverse (1000002230101), we get a palindrome (2010324230102).
The spelling of 1010322000001 in words is "one trillion, ten billion, three hundred twenty-two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •