Base | Representation |
---|---|
bin | 1001000110001001000101… |
… | …0010001100111111011001 |
3 | 1022102002122100012212210222 |
4 | 2101202101102030333121 |
5 | 2302324244030130314 |
6 | 33134241323045425 |
7 | 2051362052461316 |
oct | 221422122147731 |
9 | 38362570185728 |
10 | 10001121333209 |
11 | 32064a729a286 |
12 | 115634b370875 |
13 | 5771425683b6 |
14 | 2680b2021d0d |
15 | 1252435dec8e |
hex | 9189148cfd9 |
10001121333209 has 4 divisors (see below), whose sum is σ = 10527496140240. Its totient is φ = 9474746526180.
The previous prime is 10001121333187. The next prime is 10001121333221. The reversal of 10001121333209 is 90233312110001.
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 a de Polignac number, because none of the positive numbers 2k-10001121333209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10001121333239) 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, 263187403487 + ... + 263187403524.
It is an arithmetic number, because the mean of its divisors is an integer number (2631874035060).
Almost surely, 210001121333209 is an apocalyptic number.
10001121333209 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
10001121333209 is a deficient number, since it is larger than the sum of its proper divisors (526374807031).
10001121333209 is an equidigital number, since it uses as much as digits as its factorization.
10001121333209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 526374807030.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 10001121333209 in words is "ten trillion, one billion, one hundred twenty-one million, three hundred thirty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •