Base | Representation |
---|---|
bin | 101111100011011011… |
… | …0111101010001011011 |
3 | 100202120221211002211022 |
4 | 1133012312331101123 |
5 | 3133120324341243 |
6 | 114525153353055 |
7 | 10243433203361 |
oct | 1370666752133 |
9 | 322527732738 |
10 | 102120543323 |
11 | 3a344425747 |
12 | 1795bb6878b |
13 | 9825c410c6 |
14 | 4d2a937631 |
15 | 29ca4adb68 |
hex | 17c6dbd45b |
102120543323 has 4 divisors (see below), whose sum is σ = 102122005128. Its totient is φ = 102119081520.
The previous prime is 102120543269. The next prime is 102120543367. The reversal of 102120543323 is 323345021201.
It is a happy number.
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 102120543323 - 216 = 102120477787 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102120543292 and 102120543301.
It is not an unprimeable number, because it can be changed into a prime (102120543373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 620561 + ... + 767682.
It is an arithmetic number, because the mean of its divisors is an integer number (25530501282).
Almost surely, 2102120543323 is an apocalyptic number.
102120543323 is a deficient number, since it is larger than the sum of its proper divisors (1461805).
102120543323 is an equidigital number, since it uses as much as digits as its factorization.
102120543323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1461804.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 102120543323 its reverse (323345021201), we get a palindrome (425465564524).
The spelling of 102120543323 in words is "one hundred two billion, one hundred twenty million, five hundred forty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •