Base | Representation |
---|---|
bin | 1011101101111010001… |
… | …1010101100111100110 |
3 | 201020121002210102211122 |
4 | 2323132203111213212 |
5 | 11244231342114113 |
6 | 232251010533542 |
7 | 20354313220250 |
oct | 2733643254746 |
9 | 636532712748 |
10 | 201302301158 |
11 | 7840a9a0352 |
12 | 3301b8972b2 |
13 | 15ca108168a |
14 | 9a59040cd0 |
15 | 538296b408 |
hex | 2ede8d59e6 |
201302301158 has 64 divisors (see below), whose sum is σ = 366289317888. Its totient is φ = 81135250560.
The previous prime is 201302301157. The next prime is 201302301163. The reversal of 201302301158 is 851103203102.
It is a super-2 number, since 2×2013023011582 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201302301157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14172116 + ... + 14186312.
It is an arithmetic number, because the mean of its divisors is an integer number (5723270592).
Almost surely, 2201302301158 is an apocalyptic number.
201302301158 is a deficient number, since it is larger than the sum of its proper divisors (164987016730).
201302301158 is a wasteful number, since it uses less digits than its factorization.
201302301158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15157.
The product of its (nonzero) digits is 1440, while the sum is 26.
The spelling of 201302301158 in words is "two hundred one billion, three hundred two million, three hundred one thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •