Base | Representation |
---|---|
bin | 101111101001011010… |
… | …0111010000001100011 |
3 | 100210002221122020112221 |
4 | 1133102310322001203 |
5 | 3134023230113243 |
6 | 115001125131511 |
7 | 10251421655140 |
oct | 1372264720143 |
9 | 323087566487 |
10 | 102321332323 |
11 | 3a4377a7471 |
12 | 179b7259b97 |
13 | 9858713572 |
14 | 4d494833c7 |
15 | 29dce21bed |
hex | 17d2d3a063 |
102321332323 has 4 divisors (see below), whose sum is σ = 116938665520. Its totient is φ = 87703999128.
The previous prime is 102321332297. The next prime is 102321332329. The reversal of 102321332323 is 323233123201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323233123201 = 15401 ⋅20987801.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102321332323 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102321332329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7308666588 + ... + 7308666601.
It is an arithmetic number, because the mean of its divisors is an integer number (29234666380).
Almost surely, 2102321332323 is an apocalyptic number.
102321332323 is a deficient number, since it is larger than the sum of its proper divisors (14617333197).
102321332323 is an equidigital number, since it uses as much as digits as its factorization.
102321332323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14617333196.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 102321332323 its reverse (323233123201), we get a palindrome (425554455524).
The spelling of 102321332323 in words is "one hundred two billion, three hundred twenty-one million, three hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •