Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1000010000101000111001 |
3 | 1100010010001000001102000000 |
4 | 2110123200220100220321 |
5 | 2314104120334323001 |
6 | 33405454105303213 |
7 | 2101633013031003 |
oct | 224334050205071 |
9 | 40103030042000 |
10 | 10200021011001 |
11 | 3282893a46088 |
12 | 11889ba494b09 |
13 | 58cb1c923033 |
14 | 27397dd1d373 |
15 | 12a4d5167a86 |
hex | 946e0a10a39 |
10200021011001 has 14 divisors (see below), whose sum is σ = 15293035618410. Its totient is φ = 6800014006848.
The previous prime is 10200021010981. The next prime is 10200021011003. The reversal of 10200021011001 is 10011012000201.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 7390508665401 + 2809512345600 = 2718549^2 + 1676160^2 .
It is not a de Polignac number, because 10200021011001 - 215 = 10200020978233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10200021011003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 6995898456 + ... + 6995899913.
Almost surely, 210200021011001 is an apocalyptic number.
It is an amenable number.
10200021011001 is a deficient number, since it is larger than the sum of its proper divisors (5093014607409).
10200021011001 is an frugal number, since it uses more digits than its factorization.
10200021011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13991798387 (or 13991798372 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10200021011001 its reverse (10011012000201), we get a palindrome (20211033011202).
The spelling of 10200021011001 in words is "ten trillion, two hundred billion, twenty-one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •