Base | Representation |
---|---|
bin | 10111000000111101100000… |
… | …010100010011111010011010 |
3 | 111021101122101012121000100212 |
4 | 113000331200110103322122 |
5 | 101231401313202431020 |
6 | 555140200332131122 |
7 | 30214661320455611 |
oct | 2700754024237232 |
9 | 437348335530325 |
10 | 101221110202010 |
11 | 2a2856a4975507 |
12 | b4293b5006aa2 |
13 | 446315711ba36 |
14 | 1add1b0c58878 |
15 | ba7ed7924cc5 |
hex | 5c0f60513e9a |
101221110202010 has 96 divisors (see below), whose sum is σ = 191266345790352. Its totient is φ = 38565043404800.
The previous prime is 101221110202001. The next prime is 101221110202019. The reversal of 101221110202010 is 10202011122101.
It is an interprime number because it is at equal distance from previous prime (101221110202001) and next prime (101221110202019).
It can be written as a sum of positive squares in 8 ways, for example, as 56091426915241 + 45129683286769 = 7489421^2 + 6717863^2 .
It is not an unprimeable number, because it can be changed into a prime (101221110202019) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5031610472 + ... + 5031630588.
Almost surely, 2101221110202010 is an apocalyptic number.
101221110202010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101221110202010 is a deficient number, since it is larger than the sum of its proper divisors (90045235588342).
101221110202010 is a wasteful number, since it uses less digits than its factorization.
101221110202010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24128 (or 24105 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101221110202010 its reverse (10202011122101), we get a palindrome (111423121324111).
The spelling of 101221110202010 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred ten million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •