Base | Representation |
---|---|
bin | 101111100000001110… |
… | …1100110000000011011 |
3 | 100202022110220002011200 |
4 | 1133000131212000123 |
5 | 3132410341344011 |
6 | 114510401325243 |
7 | 10240661105010 |
oct | 1370035460033 |
9 | 322273802150 |
10 | 102013231131 |
11 | 3a29989a489 |
12 | 17930036823 |
13 | 980993a276 |
14 | 4d1a5a1707 |
15 | 29c0d62856 |
hex | 17c076601b |
102013231131 has 12 divisors (see below), whose sum is σ = 168402794352. Its totient is φ = 58293274896.
The previous prime is 102013231109. The next prime is 102013231147. The reversal of 102013231131 is 131132310201.
102013231131 is a `hidden beast` number, since 10 + 201 + 323 + 1 + 131 = 666.
It is not a de Polignac number, because 102013231131 - 214 = 102013214747 is a prime.
It is a super-2 number, since 2×1020132311312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102013232131) 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 11 ways as a sum of consecutive naturals, for example, 809628756 + ... + 809628881.
It is an arithmetic number, because the mean of its divisors is an integer number (14033566196).
Almost surely, 2102013231131 is an apocalyptic number.
102013231131 is a deficient number, since it is larger than the sum of its proper divisors (66389563221).
102013231131 is a wasteful number, since it uses less digits than its factorization.
102013231131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1619257650 (or 1619257647 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 102013231131 its reverse (131132310201), we get a palindrome (233145541332).
The spelling of 102013231131 in words is "one hundred two billion, thirteen million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •