Base | Representation |
---|---|
bin | 10001100110111001101… |
… | …000001100000100010011 |
3 | 11021200012222201100212121 |
4 | 101212321220030010103 |
5 | 124311040013132243 |
6 | 2323511050035111 |
7 | 153263634256645 |
oct | 21467150140423 |
9 | 4250188640777 |
10 | 1210000130323 |
11 | 427181590006 |
12 | 17660a718a97 |
13 | 8a14431c59a |
14 | 427c86c2895 |
15 | 2171cac21ed |
hex | 119b9a0c113 |
1210000130323 has 8 divisors (see below), whose sum is σ = 1226604456896. Its totient is φ = 1193396587200.
The previous prime is 1210000130303. The next prime is 1210000130327. The reversal of 1210000130323 is 3230310000121.
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 1210000130323 - 233 = 1201410195731 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1210000130297 and 1210000130306.
It is not an unprimeable number, because it can be changed into a prime (1210000130327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3352093 + ... + 3695473.
It is an arithmetic number, because the mean of its divisors is an integer number (153325557112).
Almost surely, 21210000130323 is an apocalyptic number.
1210000130323 is a deficient number, since it is larger than the sum of its proper divisors (16604326573).
1210000130323 is an equidigital number, since it uses as much as digits as its factorization.
1210000130323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391725.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1210000130323 its reverse (3230310000121), we get a palindrome (4440310130444).
The spelling of 1210000130323 in words is "one trillion, two hundred ten billion, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •