Base | Representation |
---|---|
bin | 11101101101110100010… |
… | …01001110110010101011 |
3 | 10121121110100111212021022 |
4 | 32312322021032302223 |
5 | 113212032214344321 |
6 | 2101015501203055 |
7 | 133524036524324 |
oct | 16667211166253 |
9 | 3547410455238 |
10 | 1021030231211 |
11 | 36401aa46971 |
12 | 145a70b6048b |
13 | 7538a236933 |
14 | 375bd4a944b |
15 | 1b85cb85dab |
hex | edba24ecab |
1021030231211 has 4 divisors (see below), whose sum is σ = 1045933407624. Its totient is φ = 996127054800.
The previous prime is 1021030231187. The next prime is 1021030231213. The reversal of 1021030231211 is 1121320301201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1021030231211 - 26 = 1021030231147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1021030231211.
It is not an unprimeable number, because it can be changed into a prime (1021030231213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12451588145 + ... + 12451588226.
It is an arithmetic number, because the mean of its divisors is an integer number (261483351906).
Almost surely, 21021030231211 is an apocalyptic number.
1021030231211 is a deficient number, since it is larger than the sum of its proper divisors (24903176413).
1021030231211 is an equidigital number, since it uses as much as digits as its factorization.
1021030231211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24903176412.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1021030231211 its reverse (1121320301201), we get a palindrome (2142350532412).
The spelling of 1021030231211 in words is "one trillion, twenty-one billion, thirty million, two hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •