Base | Representation |
---|---|
bin | 10111001100010010111011… |
… | …000101011010010100011011 |
3 | 111101011002212220202100022101 |
4 | 113030102323011122110123 |
5 | 101332132021124301243 |
6 | 1000534055133304231 |
7 | 30325154430416431 |
oct | 2714227305322433 |
9 | 441132786670271 |
10 | 102000022103323 |
11 | 2a555a6a384573 |
12 | b534355035077 |
13 | 44bb73a148bb6 |
14 | 1b28b825b6d51 |
15 | bbd3c46b654d |
hex | 5cc4bb15a51b |
102000022103323 has 8 divisors (see below), whose sum is σ = 103349007901440. Its totient is φ = 100659824486760.
The previous prime is 102000022103299. The next prime is 102000022103333. The reversal of 102000022103323 is 323301220000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102000022103323 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 102000022103323.
It is not an unprimeable number, because it can be changed into a prime (102000022103333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2197022023 + ... + 2197068448.
It is an arithmetic number, because the mean of its divisors is an integer number (12918625987680).
Almost surely, 2102000022103323 is an apocalyptic number.
102000022103323 is a deficient number, since it is larger than the sum of its proper divisors (1348985798117).
102000022103323 is a wasteful number, since it uses less digits than its factorization.
102000022103323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4394090777.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 102000022103323 its reverse (323301220000201), we get a palindrome (425301242103524).
The spelling of 102000022103323 in words is "one hundred two trillion, twenty-two million, one hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •