Base | Representation |
---|---|
bin | 1011111011001110000010… |
… | …1100101110111001011001 |
3 | 1201102111101112002121021211 |
4 | 2332303200230232321121 |
5 | 3204311344030311301 |
6 | 43515324011503121 |
7 | 2522211555105034 |
oct | 276634054567131 |
9 | 51374345077254 |
10 | 13112010010201 |
11 | 41a5854904263 |
12 | 1579241757aa1 |
13 | 7415c3725a6b |
14 | 3348a614c01b |
15 | 17b117e6d051 |
hex | bece0b2ee59 |
13112010010201 has 8 divisors (see below), whose sum is σ = 13115129126400. Its totient is φ = 13108891245120.
The previous prime is 13112010010199. The next prime is 13112010010213. The reversal of 13112010010201 is 10201001021131.
It is a happy number.
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 13112010010201 - 21 = 13112010010199 is a prime.
It is a super-2 number, since 2×131120100102012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13112010010291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83909220 + ... + 84065338.
It is an arithmetic number, because the mean of its divisors is an integer number (1639391140800).
Almost surely, 213112010010201 is an apocalyptic number.
It is an amenable number.
13112010010201 is a deficient number, since it is larger than the sum of its proper divisors (3119116199).
13112010010201 is a wasteful number, since it uses less digits than its factorization.
13112010010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175559.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 13112010010201 its reverse (10201001021131), we get a palindrome (23313011031332).
The spelling of 13112010010201 in words is "thirteen trillion, one hundred twelve billion, ten million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •