Base | Representation |
---|---|
bin | 10111001100101000011010… |
… | …110101001111000010001011 |
3 | 111101020022110111010020021102 |
4 | 113030220122311033002023 |
5 | 101333021303421441021 |
6 | 1000552433331532015 |
7 | 30326632415435150 |
oct | 2714503265170213 |
9 | 441208414106242 |
10 | 102023103312011 |
11 | 2a5648340a0252 |
12 | b538916a5a00b |
13 | 44c0977c9c62b |
14 | 1b29d31ba4227 |
15 | bbdcc5bb800b |
hex | 5cca1ad4f08b |
102023103312011 has 8 divisors (see below), whose sum is σ = 116600497251840. Its totient is φ = 87446375596008.
The previous prime is 102023103311971. The next prime is 102023103312017. The reversal of 102023103312011 is 110213301320201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102023103312011 - 214 = 102023103295627 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102023103312017) 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 7 ways as a sum of consecutive naturals, for example, 166227761 + ... + 166840386.
It is an arithmetic number, because the mean of its divisors is an integer number (14575062156480).
Almost surely, 2102023103312011 is an apocalyptic number.
102023103312011 is a deficient number, since it is larger than the sum of its proper divisors (14577393939829).
102023103312011 is an equidigital number, since it uses as much as digits as its factorization.
102023103312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333111913.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 102023103312011 its reverse (110213301320201), we get a palindrome (212236404632212).
The spelling of 102023103312011 in words is "one hundred two trillion, twenty-three billion, one hundred three million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •