Base | Representation |
---|---|
bin | 1010010001110100010010… |
… | …0111101111001001100001 |
3 | 1111000101101202211102012001 |
4 | 2210131010213233021201 |
5 | 2440124334304120301 |
6 | 40011412044004001 |
7 | 2244325344633343 |
oct | 244350447571141 |
9 | 44011352742161 |
10 | 11301210223201 |
11 | 36678a8604878 |
12 | 1326300530601 |
13 | 63c912bb6462 |
14 | 2b0da5309293 |
15 | 148e85222c01 |
hex | a47449ef261 |
11301210223201 has 8 divisors (see below), whose sum is σ = 11966433920424. Its totient is φ = 10636036151040.
The previous prime is 11301210223181. The next prime is 11301210223211. The reversal of 11301210223201 is 10232201210311.
It can be written as a sum of positive squares in 4 ways, for example, as 4106884637025 + 7194325586176 = 2026545^2 + 2682224^2 .
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 11301210223201 - 25 = 11301210223169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11301210223211) 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, 11936890 + ... + 12848803.
It is an arithmetic number, because the mean of its divisors is an integer number (1495804240053).
Almost surely, 211301210223201 is an apocalyptic number.
It is an amenable number.
11301210223201 is a deficient number, since it is larger than the sum of its proper divisors (665223697223).
11301210223201 is a wasteful number, since it uses less digits than its factorization.
11301210223201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24812531.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11301210223201 its reverse (10232201210311), we get a palindrome (21533411433512).
The spelling of 11301210223201 in words is "eleven trillion, three hundred one billion, two hundred ten million, two hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •