Base | Representation |
---|---|
bin | 10001011101111001010… |
… | …100100100100010010101 |
3 | 11020202021011010110120121 |
4 | 101131321110210202111 |
5 | 124131234303430003 |
6 | 2315231413431541 |
7 | 152502220542034 |
oct | 21357124444225 |
9 | 4222234113517 |
10 | 1200331311253 |
11 | 42306a807148 |
12 | 17477063b5b1 |
13 | 89263129579 |
14 | 4214c52c71b |
15 | 21353d31cbd |
hex | 11779524895 |
1200331311253 has 8 divisors (see below), whose sum is σ = 1214473739648. Its totient is φ = 1186236743184.
The previous prime is 1200331311239. The next prime is 1200331311301. The reversal of 1200331311253 is 3521131330021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1200331311253 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 (1200331351253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11914626 + ... + 12014947.
It is an arithmetic number, because the mean of its divisors is an integer number (151809217456).
Almost surely, 21200331311253 is an apocalyptic number.
It is an amenable number.
1200331311253 is a deficient number, since it is larger than the sum of its proper divisors (14142428395).
1200331311253 is a wasteful number, since it uses less digits than its factorization.
1200331311253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23930163.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 1200331311253 its reverse (3521131330021), we get a palindrome (4721462641274).
The spelling of 1200331311253 in words is "one trillion, two hundred billion, three hundred thirty-one million, three hundred eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •