Base | Representation |
---|---|
bin | 101111101001011101… |
… | …1010100010110100111 |
3 | 100210010001210122001101 |
4 | 1133102323110112213 |
5 | 3134024142404111 |
6 | 115001225140531 |
7 | 10251442155151 |
oct | 1372273242647 |
9 | 323101718041 |
10 | 102323013031 |
11 | 3a438745188 |
12 | 179b792a747 |
13 | 9858b81575 |
14 | 4d4979dad1 |
15 | 29dd154bc1 |
hex | 17d2ed45a7 |
102323013031 has 4 divisors (see below), whose sum is σ = 103377889552. Its totient is φ = 101268136512.
The previous prime is 102323012999. The next prime is 102323013047. The reversal of 102323013031 is 130310323201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130310323201 = 215161 ⋅605641.
It is a cyclic number.
It is not a de Polignac number, because 102323013031 - 25 = 102323012999 is a prime.
It is a super-2 number, since 2×1023230130312 (a number of 23 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 (102353013031) 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, 527438115 + ... + 527438308.
It is an arithmetic number, because the mean of its divisors is an integer number (25844472388).
Almost surely, 2102323013031 is an apocalyptic number.
102323013031 is a deficient number, since it is larger than the sum of its proper divisors (1054876521).
102323013031 is an equidigital number, since it uses as much as digits as its factorization.
102323013031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1054876520.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 102323013031 its reverse (130310323201), we get a palindrome (232633336232).
The spelling of 102323013031 in words is "one hundred two billion, three hundred twenty-three million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •