Base | Representation |
---|---|
bin | 101111100000100001… |
… | …0111110100101001001 |
3 | 100202100011022222012222 |
4 | 1133001002332211021 |
5 | 3132420343443423 |
6 | 114511351343425 |
7 | 10241140312253 |
oct | 1370102764511 |
9 | 322304288188 |
10 | 102023031113 |
11 | 3a2a4383343 |
12 | 17933381b75 |
13 | 980b98ba83 |
14 | 4d1b9d2cd3 |
15 | 29c1b4b3c8 |
hex | 17c10be949 |
102023031113 has 4 divisors (see below), whose sum is σ = 102050781060. Its totient is φ = 101995281168.
The previous prime is 102023031109. The next prime is 102023031119. The reversal of 102023031113 is 311130320201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 34312746169 + 67710284944 = 185237^2 + 260212^2 .
It is a cyclic number.
It is not a de Polignac number, because 102023031113 - 22 = 102023031109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102023031091 and 102023031100.
It is not an unprimeable number, because it can be changed into a prime (102023031119) 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, 13869458 + ... + 13876811.
It is an arithmetic number, because the mean of its divisors is an integer number (25512695265).
Almost surely, 2102023031113 is an apocalyptic number.
It is an amenable number.
102023031113 is a deficient number, since it is larger than the sum of its proper divisors (27749947).
102023031113 is an equidigital number, since it uses as much as digits as its factorization.
102023031113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27749946.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 102023031113 its reverse (311130320201), we get a palindrome (413153351314).
The spelling of 102023031113 in words is "one hundred two billion, twenty-three million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •