Base | Representation |
---|---|
bin | 10001101000110001011… |
… | …111110110010101110101 |
3 | 11021212102010220210200211 |
4 | 101220301133312111311 |
5 | 124324144332210401 |
6 | 2324442410305421 |
7 | 153364524206206 |
oct | 21506137662565 |
9 | 4255363823624 |
10 | 1212011210101 |
11 | 42801380500a |
12 | 176a90128271 |
13 | 8a3a4b75b13 |
14 | 429398235ad |
15 | 217d9422951 |
hex | 11a317f6575 |
1212011210101 has 8 divisors (see below), whose sum is σ = 1214248042080. Its totient is φ = 1209775278768.
The previous prime is 1212011210099. The next prime is 1212011210131. The reversal of 1212011210101 is 1010121102121.
It is a happy number.
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 1212011210101 - 21 = 1212011210099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212011210131) 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 7 ways as a sum of consecutive naturals, for example, 2499090 + ... + 2944396.
It is an arithmetic number, because the mean of its divisors is an integer number (151781005260).
Almost surely, 21212011210101 is an apocalyptic number.
It is an amenable number.
1212011210101 is a deficient number, since it is larger than the sum of its proper divisors (2236831979).
1212011210101 is an equidigital number, since it uses as much as digits as its factorization.
1212011210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450323.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1212011210101 its reverse (1010121102121), we get a palindrome (2222132312222).
The spelling of 1212011210101 in words is "one trillion, two hundred twelve billion, eleven million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •