Base | Representation |
---|---|
bin | 10111001100011100100000… |
… | …010011000111110101010111 |
3 | 111101012002102220111022011122 |
4 | 113030130200103013311113 |
5 | 101332314103343143111 |
6 | 1000542520045354155 |
7 | 30326000403255341 |
oct | 2714344023076527 |
9 | 441162386438148 |
10 | 102010310131031 |
11 | 2a55a369736005 |
12 | b53634656895b |
13 | 44bc6b9701963 |
14 | 1b2947aab4291 |
15 | bbd7c79bacdb |
hex | 5cc7204c7d57 |
102010310131031 has 4 divisors (see below), whose sum is σ = 102025597161552. Its totient is φ = 101995023100512.
The previous prime is 102010310131007. The next prime is 102010310131061. The reversal of 102010310131031 is 130131013010201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102010310131031 - 226 = 102010243022167 is a prime.
It is a super-2 number, since 2×1020103101310312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010310131061) 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, 7643505251 + ... + 7643518596.
It is an arithmetic number, because the mean of its divisors is an integer number (25506399290388).
Almost surely, 2102010310131031 is an apocalyptic number.
102010310131031 is a deficient number, since it is larger than the sum of its proper divisors (15287030521).
102010310131031 is an equidigital number, since it uses as much as digits as its factorization.
102010310131031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15287030520.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 102010310131031 its reverse (130131013010201), we get a palindrome (232141323141232).
The spelling of 102010310131031 in words is "one hundred two trillion, ten billion, three hundred ten million, one hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •