Base | Representation |
---|---|
bin | 1001000110110001101001… |
… | …0011100110000011100001 |
3 | 1022110010202012101010010202 |
4 | 2101230122103212003201 |
5 | 2303014044042024301 |
6 | 33143242015234545 |
7 | 2052225641532620 |
oct | 221543223460341 |
9 | 38403665333122 |
10 | 10012010111201 |
11 | 321008477135a |
12 | 1158489b18a55 |
13 | 5781894203b7 |
14 | 26882621d6b7 |
15 | 12567e50e66b |
hex | 91b1a4e60e1 |
10012010111201 has 8 divisors (see below), whose sum is σ = 11499796252800. Its totient is φ = 8538598715328.
The previous prime is 10012010111179. The next prime is 10012010111273. The reversal of 10012010111201 is 10211101021001.
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 10012010111201 - 222 = 10012005916897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10012010111801) 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 7 ways as a sum of consecutive naturals, for example, 3593684936 + ... + 3593687721.
It is an arithmetic number, because the mean of its divisors is an integer number (1437474531600).
Almost surely, 210012010111201 is an apocalyptic number.
It is an amenable number.
10012010111201 is a deficient number, since it is larger than the sum of its proper divisors (1487786141599).
10012010111201 is an equidigital number, since it uses as much as digits as its factorization.
10012010111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7187372863.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10012010111201 its reverse (10211101021001), we get a palindrome (20223111132202).
The spelling of 10012010111201 in words is "ten trillion, twelve billion, ten million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •