Base | Representation |
---|---|
bin | 10001101000000011000… |
… | …000010110001100011110 |
3 | 11021210101210012012000221 |
4 | 101220003000112030132 |
5 | 124321100141400110 |
6 | 2324233144111554 |
7 | 153336303220315 |
oct | 21500300261436 |
9 | 4253353165027 |
10 | 1211231200030 |
11 | 427753487995 |
12 | 1768b2a655ba |
13 | 8a2ac3a18b7 |
14 | 428a3dbd27c |
15 | 21790be87da |
hex | 11a0301631e |
1211231200030 has 8 divisors (see below), whose sum is σ = 2180216160072. Its totient is φ = 484492480008.
The previous prime is 1211231200021. The next prime is 1211231200037. The reversal of 1211231200030 is 300021321121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12112312000302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211231199977 and 1211231200013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211231200037) 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, 60561559992 + ... + 60561560011.
It is an arithmetic number, because the mean of its divisors is an integer number (272527020009).
Almost surely, 21211231200030 is an apocalyptic number.
1211231200030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1211231200030 is a deficient number, since it is larger than the sum of its proper divisors (968984960042).
1211231200030 is a wasteful number, since it uses less digits than its factorization.
1211231200030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121123120010.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1211231200030 its reverse (300021321121), we get a palindrome (1511252521151).
The spelling of 1211231200030 in words is "one trillion, two hundred eleven billion, two hundred thirty-one million, two hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •