Base | Representation |
---|---|
bin | 101101011001111010011… |
… | …111000100010001010010 |
3 | 102001021210012001222112200 |
4 | 231121322133010101102 |
5 | 402110133003034302 |
6 | 10345222312504030 |
7 | 441266331531162 |
oct | 55317237042122 |
9 | 12037705058480 |
10 | 3120201221202 |
11 | aa32a727830a |
12 | 4248710ab016 |
13 | 19830660b370 |
14 | ab038c5c5a2 |
15 | 5626c1e581c |
hex | 2d67a7c4452 |
3120201221202 has 72 divisors (see below), whose sum is σ = 7733924532516. Its totient is φ = 903587664384.
The previous prime is 3120201221201. The next prime is 3120201221369. The reversal of 3120201221202 is 2021221020213.
3120201221202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 918244979001 + 2201956242201 = 958251^2 + 1483899^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (3120201221201) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 23001913 + ... + 23137164.
Almost surely, 23120201221202 is an apocalyptic number.
3120201221202 is an abundant number, since it is smaller than the sum of its proper divisors (4613723311314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3120201221202 is a wasteful number, since it uses less digits than its factorization.
3120201221202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46139132 (or 46139112 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 3120201221202 its reverse (2021221020213), we get a palindrome (5141422241415).
The spelling of 3120201221202 in words is "three trillion, one hundred twenty billion, two hundred one million, two hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •