Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0110100111110010101001 |
3 | 1022101222202221221011100212 |
4 | 2101201033012213302221 |
5 | 2302320010304013001 |
6 | 33133535220510505 |
7 | 2051322411013220 |
oct | 221411706476251 |
9 | 38358687834325 |
10 | 10000011001001 |
11 | 3205a8756825a |
12 | 115609b54b435 |
13 | 576cc650a8a8 |
14 | 268008793cb7 |
15 | 1251cadb77bb |
hex | 9184f1a7ca9 |
10000011001001 has 4 divisors (see below), whose sum is σ = 11428584001152. Its totient is φ = 8571438000852.
The previous prime is 10000011000851. The next prime is 10000011001003. The reversal of 10000011001001 is 10010011000001.
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 10000011001001 - 214 = 10000010984617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10000011001003) 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, 714286500065 + ... + 714286500078.
It is an arithmetic number, because the mean of its divisors is an integer number (2857146000288).
Almost surely, 210000011001001 is an apocalyptic number.
It is an amenable number.
10000011001001 is a deficient number, since it is larger than the sum of its proper divisors (1428573000151).
10000011001001 is an equidigital number, since it uses as much as digits as its factorization.
10000011001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1428573000150.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10000011001001 its reverse (10010011000001), we get a palindrome (20010022001002).
It can be divided in two parts, 1000001 and 1001001, that multiplied together give a palindrome (1001002001001).
The spelling of 10000011001001 in words is "ten trillion, eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •