Base | Representation |
---|---|
bin | 10111000010100100110010… |
… | …011110010011111011111110 |
3 | 111021210020122000112201010002 |
4 | 113002210302132103323332 |
5 | 101240210424104040220 |
6 | 555303141032314302 |
7 | 30225665451205211 |
oct | 2702446236237376 |
9 | 437706560481102 |
10 | 101332010221310 |
11 | 2a318734060420 |
12 | b4469a5242992 |
13 | 447074bc1b02b |
14 | 1b046d17a1778 |
15 | baad28a4ec75 |
hex | 5c2932793efe |
101332010221310 has 32 divisors (see below), whose sum is σ = 199569662933472. Its totient is φ = 36738662446080.
The previous prime is 101332010221303. The next prime is 101332010221313. The reversal of 101332010221310 is 13122010233101.
It is a happy number.
It is a super-2 number, since 2×1013320102213102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101332010221313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1366728647 + ... + 1366802786.
It is an arithmetic number, because the mean of its divisors is an integer number (6236551966671).
Almost surely, 2101332010221310 is an apocalyptic number.
101332010221310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101332010221310 is a deficient number, since it is larger than the sum of its proper divisors (98237652712162).
101332010221310 is a wasteful number, since it uses less digits than its factorization.
101332010221310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2733531788.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 101332010221310 its reverse (13122010233101), we get a palindrome (114454020454411).
The spelling of 101332010221310 in words is "one hundred one trillion, three hundred thirty-two billion, ten million, two hundred twenty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •