Base | Representation |
---|---|
bin | 10111001100101000011100… |
… | …100110011111010110010111 |
3 | 111101020022112112222121001201 |
4 | 113030220130212133112113 |
5 | 101333021334022013421 |
6 | 1000552440312133331 |
7 | 30326633226000250 |
oct | 2714503446372627 |
9 | 441208475877051 |
10 | 102023133001111 |
11 | 2a5648499290a3 |
12 | b538924997247 |
13 | 44c0981195c4a |
14 | 1b29d35ad1b27 |
15 | bbdcc85ceb91 |
hex | 5cca1c99f597 |
102023133001111 has 8 divisors (see below), whose sum is σ = 119749159970720. Its totient is φ = 85084929452448.
The previous prime is 102023133001079. The next prime is 102023133001169. The reversal of 102023133001111 is 111100331320201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102023133001111 - 25 = 102023133001079 is a prime.
It is a super-3 number, since 3×1020231330011113 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102023131001111) 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, 196955854956 + ... + 196955855473.
It is an arithmetic number, because the mean of its divisors is an integer number (14968644996340).
Almost surely, 2102023133001111 is an apocalyptic number.
102023133001111 is a deficient number, since it is larger than the sum of its proper divisors (17726026969609).
102023133001111 is an equidigital number, since it uses as much as digits as its factorization.
102023133001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 393911710473.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 102023133001111 its reverse (111100331320201), we get a palindrome (213123464321312).
The spelling of 102023133001111 in words is "one hundred two trillion, twenty-three billion, one hundred thirty-three million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •