Base | Representation |
---|---|
bin | 10001100001100001101… |
… | …110000100110111110101 |
3 | 11021010022212210012021221 |
4 | 101201201232010313311 |
5 | 124212230424431123 |
6 | 2321114334510341 |
7 | 153000643520323 |
oct | 21414156046765 |
9 | 4233285705257 |
10 | 1204230311413 |
11 | 424790686728 |
12 | 17547a3653b1 |
13 | 89734b4735c |
14 | 423dc2b0d13 |
15 | 214d12a625d |
hex | 11861b84df5 |
1204230311413 has 4 divisors (see below), whose sum is σ = 1204383276268. Its totient is φ = 1204077346560.
The previous prime is 1204230311411. The next prime is 1204230311461. The reversal of 1204230311413 is 3141130324021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12100440004 + 1192129871409 = 110002^2 + 1091847^2 .
It is a cyclic number.
It is not a de Polignac number, because 1204230311413 - 21 = 1204230311411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1204230311411) 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, 76470618 + ... + 76486363.
It is an arithmetic number, because the mean of its divisors is an integer number (301095819067).
Almost surely, 21204230311413 is an apocalyptic number.
It is an amenable number.
1204230311413 is a deficient number, since it is larger than the sum of its proper divisors (152964855).
1204230311413 is an equidigital number, since it uses as much as digits as its factorization.
1204230311413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152964854.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1204230311413 its reverse (3141130324021), we get a palindrome (4345360635434).
The spelling of 1204230311413 in words is "one trillion, two hundred four billion, two hundred thirty million, three hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •