Base | Representation |
---|---|
bin | 11101000111000011101… |
… | …00010100010100110011 |
3 | 10112121202010021102212200 |
4 | 32203201310110110303 |
5 | 112341423034013021 |
6 | 2043254543154243 |
7 | 132156260141601 |
oct | 16434164242463 |
9 | 3477663242780 |
10 | 1000221001011 |
11 | 356211752261 |
12 | 141a23ba5983 |
13 | 73421cc6a7b |
14 | 365a7934871 |
15 | 1b040d6d126 |
hex | e8e1d14533 |
1000221001011 has 48 divisors (see below), whose sum is σ = 1528224122880. Its totient is φ = 629366832000.
The previous prime is 1000221001009. The next prime is 1000221001049. The reversal of 1000221001011 is 1101001220001.
It is a happy number.
It is not a de Polignac number, because 1000221001011 - 21 = 1000221001009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1000221000984 and 1000221001002.
It is not an unprimeable number, because it can be changed into a prime (1000221000011) 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 47 ways as a sum of consecutive naturals, for example, 41980660 + ... + 42004478.
It is an arithmetic number, because the mean of its divisors is an integer number (31838002560).
Almost surely, 21000221001011 is an apocalyptic number.
1000221001011 is a deficient number, since it is larger than the sum of its proper divisors (528003121869).
1000221001011 is a wasteful number, since it uses less digits than its factorization.
1000221001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27568 (or 27565 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1000221001011 its reverse (1101001220001), we get a palindrome (2101222221012).
The spelling of 1000221001011 in words is "one trillion, two hundred twenty-one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •