Base | Representation |
---|---|
bin | 10111000010010001100000… |
… | …101010001010000110100010 |
3 | 111021201021012101212211001111 |
4 | 113002101200222022012202 |
5 | 101234341030410222320 |
6 | 555245435020053534 |
7 | 30224333466245005 |
oct | 2702214052120642 |
9 | 437637171784044 |
10 | 101311310242210 |
11 | 2a30a9814a6782 |
12 | b4429889942aa |
13 | 446b8005106a3 |
14 | 1b036ca54953c |
15 | baa516617a5a |
hex | 5c2460a8a1a2 |
101311310242210 has 32 divisors (see below), whose sum is σ = 182590602301440. Its totient is φ = 40473389242368.
The previous prime is 101311310242157. The next prime is 101311310242213. The reversal of 101311310242210 is 12242013113101.
It is not an unprimeable number, because it can be changed into a prime (101311310242213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24740194 + ... + 28542946.
It is an arithmetic number, because the mean of its divisors is an integer number (5705956321920).
Almost surely, 2101311310242210 is an apocalyptic number.
101311310242210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101311310242210 is a deficient number, since it is larger than the sum of its proper divisors (81279292059230).
101311310242210 is a wasteful number, since it uses less digits than its factorization.
101311310242210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3806122.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 101311310242210 its reverse (12242013113101), we get a palindrome (113553323355311).
The spelling of 101311310242210 in words is "one hundred one trillion, three hundred eleven billion, three hundred ten million, two hundred forty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •