Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …111011100101100011111010 |
3 | 111020121121021202102112201202 |
4 | 112331300201323211203322 |
5 | 101214300042132414320 |
6 | 554451121135414202 |
7 | 30163040302356653 |
oct | 2675604173454372 |
9 | 436547252375652 |
10 | 101001020201210 |
11 | 2a2003238a3368 |
12 | b3b2811384362 |
13 | 44484808a282c |
14 | 1ad269294452a |
15 | ba24058a7b75 |
hex | 5bdc21ee58fa |
101001020201210 has 8 divisors (see below), whose sum is σ = 181801836362196. Its totient is φ = 40400408080480.
The previous prime is 101001020201129. The next prime is 101001020201219. The reversal of 101001020201210 is 12102020100101.
It can be written as a sum of positive squares in 2 ways, for example, as 100525749220009 + 475270981201 = 10026253^2 + 689399^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101001020201191 and 101001020201200.
It is not an unprimeable number, because it can be changed into a prime (101001020201219) 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, 5050051010051 + ... + 5050051010070.
Almost surely, 2101001020201210 is an apocalyptic number.
101001020201210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101001020201210 is a deficient number, since it is larger than the sum of its proper divisors (80800816160986).
101001020201210 is a wasteful number, since it uses less digits than its factorization.
101001020201210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100102020128.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101001020201210 its reverse (12102020100101), we get a palindrome (113103040301311).
The spelling of 101001020201210 in words is "one hundred one trillion, one billion, twenty million, two hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •