Base | Representation |
---|---|
bin | 101111101001011001… |
… | …1101110000001011111 |
3 | 100210002221001102112022 |
4 | 1133102303232001133 |
5 | 3134023140133043 |
6 | 115001114330355 |
7 | 10251416220434 |
oct | 1372263560137 |
9 | 323087042468 |
10 | 102321021023 |
11 | 3a4376045a1 |
12 | 179b71299bb |
13 | 9858634970 |
14 | 4d49401b8b |
15 | 29dcdae868 |
hex | 17d2cee05f |
102321021023 has 4 divisors (see below), whose sum is σ = 110191868808. Its totient is φ = 94450173240.
The previous prime is 102321020981. The next prime is 102321021091. The reversal of 102321021023 is 320120123201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102321021023 - 26 = 102321020959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102321020992 and 102321021010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102321027023) 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, 3935423873 + ... + 3935423898.
It is an arithmetic number, because the mean of its divisors is an integer number (27547967202).
Almost surely, 2102321021023 is an apocalyptic number.
102321021023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102321021023 is a deficient number, since it is larger than the sum of its proper divisors (7870847785).
102321021023 is an equidigital number, since it uses as much as digits as its factorization.
102321021023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7870847784.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102321021023 its reverse (320120123201), we get a palindrome (422441144224).
The spelling of 102321021023 in words is "one hundred two billion, three hundred twenty-one million, twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •