Base | Representation |
---|---|
bin | 101111011111111010… |
… | …0000000111001011111 |
3 | 100202021201101022022200 |
4 | 1132333310000321133 |
5 | 3132400044044411 |
6 | 114505331542543 |
7 | 10240466336613 |
oct | 1367764007137 |
9 | 322251338280 |
10 | 102002331231 |
11 | 3a2937251a9 |
12 | 1792845aa53 |
13 | 98075c1c18 |
14 | 4d18d65343 |
15 | 29bee0ce56 |
hex | 17bfd00e5f |
102002331231 has 24 divisors (see below), whose sum is σ = 159282929520. Its totient is φ = 62681371776.
The previous prime is 102002331203. The next prime is 102002331253. The reversal of 102002331231 is 132133200201.
102002331231 is a `hidden beast` number, since 1 + 0 + 200 + 233 + 1 + 231 = 666.
It is not a de Polignac number, because 102002331231 - 29 = 102002330719 is a prime.
It is a super-2 number, since 2×1020023312312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002330231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8054550 + ... + 8067203.
It is an arithmetic number, because the mean of its divisors is an integer number (6636788730).
Almost surely, 2102002331231 is an apocalyptic number.
102002331231 is a deficient number, since it is larger than the sum of its proper divisors (57280598289).
102002331231 is a wasteful number, since it uses less digits than its factorization.
102002331231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16121815 (or 16121812 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 102002331231 its reverse (132133200201), we get a palindrome (234135531432).
The spelling of 102002331231 in words is "one hundred two billion, two million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •