Base | Representation |
---|---|
bin | 10001011101110001100… |
… | …100010110111010001101 |
3 | 11020201221002100202101222 |
4 | 101131301210112322031 |
5 | 124131003003411023 |
6 | 2315210445413125 |
7 | 152466051101210 |
oct | 21356144267215 |
9 | 4221832322358 |
10 | 1200201232013 |
11 | 423003340743 |
12 | 174734b6a1a5 |
13 | 892421b39c4 |
14 | 4213914b777 |
15 | 213476d9cc8 |
hex | 11771916e8d |
1200201232013 has 8 divisors (see below), whose sum is σ = 1394144757120. Its totient is φ = 1011879258480.
The previous prime is 1200201231979. The next prime is 1200201232051. The reversal of 1200201232013 is 3102321020021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1200201232013 - 26 = 1200201231949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200201231982 and 1200201232000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200201231013) 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, 1405387433 + ... + 1405388286.
It is an arithmetic number, because the mean of its divisors is an integer number (174268094640).
Almost surely, 21200201232013 is an apocalyptic number.
It is an amenable number.
1200201232013 is a deficient number, since it is larger than the sum of its proper divisors (193943525107).
1200201232013 is an equidigital number, since it uses as much as digits as its factorization.
1200201232013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2810775787.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1200201232013 its reverse (3102321020021), we get a palindrome (4302522252034).
The spelling of 1200201232013 in words is "one trillion, two hundred billion, two hundred one million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •