Base | Representation |
---|---|
bin | 10001011111011110101… |
… | …100001110001111100101 |
3 | 11020220122200021220221222 |
4 | 101133132230032033211 |
5 | 124143230143311323 |
6 | 2320112245350125 |
7 | 152562321335036 |
oct | 21373654161745 |
9 | 4226580256858 |
10 | 1202032010213 |
11 | 423862807481 |
12 | 174b66108345 |
13 | 8947458c008 |
14 | 42270356a8d |
15 | 214032c29c8 |
hex | 117deb0e3e5 |
1202032010213 has 4 divisors (see below), whose sum is σ = 1202042139648. Its totient is φ = 1202021880780.
The previous prime is 1202032010203. The next prime is 1202032010327. The reversal of 1202032010213 is 3120102302021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1202032010213 - 28 = 1202032009957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1202032010191 and 1202032010200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1202032010203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4884581 + ... + 5124762.
It is an arithmetic number, because the mean of its divisors is an integer number (300510534912).
Almost surely, 21202032010213 is an apocalyptic number.
It is an amenable number.
1202032010213 is a deficient number, since it is larger than the sum of its proper divisors (10129435).
1202032010213 is a wasteful number, since it uses less digits than its factorization.
1202032010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10129434.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1202032010213 its reverse (3120102302021), we get a palindrome (4322134312234).
The spelling of 1202032010213 in words is "one trillion, two hundred two billion, thirty-two million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •