Base | Representation |
---|---|
bin | 10000101111000010100… |
… | …011000000010011001001 |
3 | 11001221101212221102202002 |
4 | 100233002203000103021 |
5 | 122320220134133301 |
6 | 2240151220320345 |
7 | 146041400421662 |
oct | 20570243002311 |
9 | 4057355842662 |
10 | 1150020224201 |
11 | 4037a2487862 |
12 | 166a6b5430b5 |
13 | 845a5aa9484 |
14 | 3d938780369 |
15 | 1edabedd16b |
hex | 10bc28c04c9 |
1150020224201 has 8 divisors (see below), whose sum is σ = 1178084910408. Its totient is φ = 1121956272000.
The previous prime is 1150020224149. The next prime is 1150020224209. The reversal of 1150020224201 is 1024220200511.
It can be written as a sum of positive squares in 4 ways, for example, as 14442270976 + 1135577953225 = 120176^2 + 1065635^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1150020224201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1150020224209) 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, 4320971 + ... + 4579391.
It is an arithmetic number, because the mean of its divisors is an integer number (147260613801).
Almost surely, 21150020224201 is an apocalyptic number.
It is an amenable number.
1150020224201 is a deficient number, since it is larger than the sum of its proper divisors (28064686207).
1150020224201 is a wasteful number, since it uses less digits than its factorization.
1150020224201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367003.
The product of its (nonzero) digits is 320, while the sum is 20.
Adding to 1150020224201 its reverse (1024220200511), we get a palindrome (2174240424712).
The spelling of 1150020224201 in words is "one trillion, one hundred fifty billion, twenty million, two hundred twenty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •