Base | Representation |
---|---|
bin | 10001011101100110111… |
… | …000110000011111101001 |
3 | 11020201110121011100212222 |
4 | 101131212320300133221 |
5 | 124130121114432223 |
6 | 2315141004443425 |
7 | 152461443646241 |
oct | 21354670603751 |
9 | 4221417140788 |
10 | 1200022030313 |
11 | 422a21173867 |
12 | 1746a4b49575 |
13 | 8921402c2b2 |
14 | 4211d420b21 |
15 | 21336add0c8 |
hex | 11766e307e9 |
1200022030313 has 4 divisors (see below), whose sum is σ = 1263181084560. Its totient is φ = 1136862976068.
The previous prime is 1200022030307. The next prime is 1200022030381. The reversal of 1200022030313 is 3130302200021.
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 1200022030313 - 24 = 1200022030297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200022030291 and 1200022030300.
It is not an unprimeable number, because it can be changed into a prime (1200022030303) 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, 31579527095 + ... + 31579527132.
It is an arithmetic number, because the mean of its divisors is an integer number (315795271140).
Almost surely, 21200022030313 is an apocalyptic number.
It is an amenable number.
1200022030313 is a deficient number, since it is larger than the sum of its proper divisors (63159054247).
1200022030313 is an equidigital number, since it uses as much as digits as its factorization.
1200022030313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63159054246.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 1200022030313 its reverse (3130302200021), we get a palindrome (4330324230334).
The spelling of 1200022030313 in words is "one trillion, two hundred billion, twenty-two million, thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •