Base | Representation |
---|---|
bin | 10111000000110101000001… |
… | …111010100100000001110001 |
3 | 111021100202220000100002000212 |
4 | 113000311001322210001301 |
5 | 101231224144102414301 |
6 | 555132053335353505 |
7 | 30214216651650164 |
oct | 2700650172440161 |
9 | 437322800302025 |
10 | 101212010201201 |
11 | 2a281855192189 |
12 | b427695522895 |
13 | 4462336a27783 |
14 | 1adc98a451adb |
15 | ba7b53a934bb |
hex | 5c0d41ea4071 |
101212010201201 has 16 divisors (see below), whose sum is σ = 101708490240000. Its totient is φ = 100717108769616.
The previous prime is 101212010201167. The next prime is 101212010201231. The reversal of 101212010201201 is 102102010212101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101212010201201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101212010201231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 248560910 + ... + 248967768.
It is an arithmetic number, because the mean of its divisors is an integer number (6356780640000).
Almost surely, 2101212010201201 is an apocalyptic number.
It is an amenable number.
101212010201201 is a deficient number, since it is larger than the sum of its proper divisors (496480038799).
101212010201201 is an equidigital number, since it uses as much as digits as its factorization.
101212010201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408796.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101212010201201 its reverse (102102010212101), we get a palindrome (203314020413302).
The spelling of 101212010201201 in words is "one hundred one trillion, two hundred twelve billion, ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •