Base | Representation |
---|---|
bin | 11101101101111101110… |
… | …01100001110101101001 |
3 | 10121121122220121120211222 |
4 | 32312332321201311221 |
5 | 113212213130013001 |
6 | 2101031431031425 |
7 | 133526025541316 |
oct | 16667671416551 |
9 | 3547586546758 |
10 | 1021110001001 |
11 | 364060a80112 |
12 | 145a9380b575 |
13 | 753a09162ac |
14 | 375c9d11d0d |
15 | 1b864b9161b |
hex | edbee61d69 |
1021110001001 has 4 divisors (see below), whose sum is σ = 1025949385104. Its totient is φ = 1016270616900.
The previous prime is 1021110000997. The next prime is 1021110001129. The reversal of 1021110001001 is 1001000111201.
It is a happy number.
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 1021110001001 - 22 = 1021110000997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1021110001001.
It is not an unprimeable number, because it can be changed into a prime (1021110006001) 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, 2419691735 + ... + 2419692156.
It is an arithmetic number, because the mean of its divisors is an integer number (256487346276).
Almost surely, 21021110001001 is an apocalyptic number.
It is an amenable number.
1021110001001 is a deficient number, since it is larger than the sum of its proper divisors (4839384103).
1021110001001 is an equidigital number, since it uses as much as digits as its factorization.
1021110001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4839384102.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1021110001001 its reverse (1001000111201), we get a palindrome (2022110112202).
The spelling of 1021110001001 in words is "one trillion, twenty-one billion, one hundred ten million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •