Base | Representation |
---|---|
bin | 10001011101110011010… |
… | …110010010111110100001 |
3 | 11020202000011120020000121 |
4 | 101131303112102332201 |
5 | 124131033130202241 |
6 | 2315213433520241 |
7 | 152466563010631 |
oct | 21356326227641 |
9 | 4222004506017 |
10 | 1200231100321 |
11 | 4230191911a0 |
12 | 174742b73081 |
13 | 89248440a66 |
14 | 4213d0c46c1 |
15 | 2134a139ad1 |
hex | 11773592fa1 |
1200231100321 has 8 divisors (see below), whose sum is σ = 1309356547488. Its totient is φ = 1091107908000.
The previous prime is 1200231100253. The next prime is 1200231100349. The reversal of 1200231100321 is 1230011320021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1200231100321 - 219 = 1200230576033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1200231100295 and 1200231100304.
It is not an unprimeable number, because it can be changed into a prime (1200231100351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 665886 + ... + 1686376.
It is an arithmetic number, because the mean of its divisors is an integer number (163669568436).
Almost surely, 21200231100321 is an apocalyptic number.
1200231100321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1200231100321 is a deficient number, since it is larger than the sum of its proper divisors (109125447167).
1200231100321 is a wasteful number, since it uses less digits than its factorization.
1200231100321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1127423.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1200231100321 its reverse (1230011320021), we get a palindrome (2430242420342).
The spelling of 1200231100321 in words is "one trillion, two hundred billion, two hundred thirty-one million, one hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •