Base | Representation |
---|---|
bin | 1000101110111010010010… |
… | …0001101110101111101001 |
3 | 1020222221110201222212001101 |
4 | 2023232210201232233221 |
5 | 2224304410111242301 |
6 | 32231034205321401 |
7 | 2010502546100203 |
oct | 213564441565751 |
9 | 36887421885041 |
10 | 9602012212201 |
11 | 307221062a512 |
12 | 10b0b26566261 |
13 | 54860967bcb6 |
14 | 252a502c3773 |
15 | 119b85020701 |
hex | 8bba486ebe9 |
9602012212201 has 8 divisors (see below), whose sum is σ = 9862126056584. Its totient is φ = 9341929946880.
The previous prime is 9602012212193. The next prime is 9602012212213. The reversal of 9602012212201 is 1022122102069.
It can be written as a sum of positive squares in 4 ways, for example, as 6650828366400 + 2951183845801 = 2578920^2 + 1717901^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 9602012212201 - 23 = 9602012212193 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 9602012212201.
It is not an unprimeable number, because it can be changed into a prime (9602012212231) 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, 7277760 + ... + 8495281.
It is an arithmetic number, because the mean of its divisors is an integer number (1232765757073).
Almost surely, 29602012212201 is an apocalyptic number.
It is an amenable number.
9602012212201 is a deficient number, since it is larger than the sum of its proper divisors (260113844383).
9602012212201 is a wasteful number, since it uses less digits than its factorization.
9602012212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15789531.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 9602012212201 in words is "nine trillion, six hundred two billion, twelve million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.307 sec. • engine limits •