Base | Representation |
---|---|
bin | 101111100110001110… |
… | …1000111000100101111 |
3 | 100202211111111002112112 |
4 | 1133030131013010233 |
5 | 3133313343243043 |
6 | 114542345554235 |
7 | 10245653220425 |
oct | 1371435070457 |
9 | 322744432475 |
10 | 102214431023 |
11 | 3a392421991 |
12 | 179874a597b |
13 | 983c524763 |
14 | 4d391b7115 |
15 | 29d3857518 |
hex | 17cc74712f |
102214431023 has 4 divisors (see below), whose sum is σ = 104707465968. Its totient is φ = 99721396080.
The previous prime is 102214430959. The next prime is 102214431049. The reversal of 102214431023 is 320134412201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320134412201 = 23 ⋅13918887487.
It is a cyclic number.
It is not a de Polignac number, because 102214431023 - 26 = 102214430959 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102214431023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102214431073) 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, 1246517411 + ... + 1246517492.
It is an arithmetic number, because the mean of its divisors is an integer number (26176866492).
Almost surely, 2102214431023 is an apocalyptic number.
102214431023 is a deficient number, since it is larger than the sum of its proper divisors (2493034945).
102214431023 is an equidigital number, since it uses as much as digits as its factorization.
102214431023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2493034944.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 102214431023 its reverse (320134412201), we get a palindrome (422348843224).
The spelling of 102214431023 in words is "one hundred two billion, two hundred fourteen million, four hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •