Base | Representation |
---|---|
bin | 10000000010010101100… |
… | …000110000101100001001 |
3 | 10220100111200002110121101 |
4 | 100002111200300230021 |
5 | 121023414111133001 |
6 | 2202132213341401 |
7 | 142422040423414 |
oct | 20022540605411 |
9 | 3810450073541 |
10 | 1102020021001 |
11 | 395400632739 |
12 | 1596b4337861 |
13 | 7cbc6442483 |
14 | 3b4a3894b7b |
15 | 1d9ecebaa01 |
hex | 10095830b09 |
1102020021001 has 8 divisors (see below), whose sum is σ = 1116067627520. Its totient is φ = 1087974864288.
The previous prime is 1102020020951. The next prime is 1102020021007. The reversal of 1102020021001 is 1001200202011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102020021001 - 215 = 1102019988233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102020021007) 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 7 ways as a sum of consecutive naturals, for example, 301600 + ... + 1514926.
It is an arithmetic number, because the mean of its divisors is an integer number (139508453440).
Almost surely, 21102020021001 is an apocalyptic number.
It is an amenable number.
1102020021001 is a deficient number, since it is larger than the sum of its proper divisors (14047606519).
1102020021001 is a wasteful number, since it uses less digits than its factorization.
1102020021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1224903.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1102020021001 its reverse (1001200202011), we get a palindrome (2103220223012).
The spelling of 1102020021001 in words is "one trillion, one hundred two billion, twenty million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •