Base | Representation |
---|---|
bin | 11101000111001101010… |
… | …10000100100101000001 |
3 | 10112121221210001211112100 |
4 | 32203212222010211001 |
5 | 112342104330414103 |
6 | 2043311003421013 |
7 | 132161264263653 |
oct | 16434652044501 |
9 | 3477853054470 |
10 | 1000302201153 |
11 | 356253573112 |
12 | 141a47224769 |
13 | 73435a874a8 |
14 | 365b46306d3 |
15 | 1b04805c5a3 |
hex | e8e6a84941 |
1000302201153 has 6 divisors (see below), whose sum is σ = 1444880957234. Its totient is φ = 666868134096.
The previous prime is 1000302201097. The next prime is 1000302201163. The reversal of 1000302201153 is 3511022030001.
1000302201153 is a `hidden beast` number, since 10 + 0 + 0 + 302 + 201 + 153 = 666.
It can be written as a sum of positive squares in only one way, i.e., 678033671184 + 322268529969 = 823428^2 + 567687^2 .
It is not a de Polignac number, because 1000302201153 - 222 = 1000298006849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000302201163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55572344500 + ... + 55572344517.
Almost surely, 21000302201153 is an apocalyptic number.
It is an amenable number.
1000302201153 is a deficient number, since it is larger than the sum of its proper divisors (444578756081).
1000302201153 is a wasteful number, since it uses less digits than its factorization.
1000302201153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111144689023 (or 111144689020 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
Adding to 1000302201153 its reverse (3511022030001), we get a palindrome (4511324231154).
The spelling of 1000302201153 in words is "one trillion, three hundred two million, two hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •