Base | Representation |
---|---|
bin | 10111001100011111000001… |
… | …111000010101111111100011 |
3 | 111101012100102211111201220122 |
4 | 113030133001320111333203 |
5 | 101332340131340121011 |
6 | 1000544045045230455 |
7 | 30326124521403164 |
oct | 2714370170257743 |
9 | 441170384451818 |
10 | 102013021020131 |
11 | 2a56052a98a121 |
12 | b53698240242b |
13 | 44bca2c22b850 |
14 | 1b29656b3d76b |
15 | bbd8d59a23db |
hex | 5cc7c1e15fe3 |
102013021020131 has 4 divisors (see below), whose sum is σ = 109860176483232. Its totient is φ = 94165865557032.
The previous prime is 102013021020073. The next prime is 102013021020151. The reversal of 102013021020131 is 131020120310201.
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 102013021020131 - 26 = 102013021020067 is a prime.
It is a super-2 number, since 2×1020130210201312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102013021020151) 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, 3923577731531 + ... + 3923577731556.
It is an arithmetic number, because the mean of its divisors is an integer number (27465044120808).
Almost surely, 2102013021020131 is an apocalyptic number.
102013021020131 is a deficient number, since it is larger than the sum of its proper divisors (7847155463101).
102013021020131 is an equidigital number, since it uses as much as digits as its factorization.
102013021020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7847155463100.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102013021020131 its reverse (131020120310201), we get a palindrome (233033141330332).
The spelling of 102013021020131 in words is "one hundred two trillion, thirteen billion, twenty-one million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •