Base | Representation |
---|---|
bin | 10111001100100110101011… |
… | …010110101001010000111011 |
3 | 111101020010122010211122201102 |
4 | 113030212223112221100323 |
5 | 101333003441123201021 |
6 | 1000551524001042015 |
7 | 30326535155305502 |
oct | 2714465326512073 |
9 | 441203563748642 |
10 | 102021233022011 |
11 | 2a563a64397736 |
12 | b53849462630b |
13 | 44c073a66ba64 |
14 | 1b29bd5631839 |
15 | bbdc168c800b |
hex | 5cc9ab5a943b |
102021233022011 has 4 divisors (see below), whose sum is σ = 102044756483352. Its totient is φ = 101997709560672.
The previous prime is 102021233021971. The next prime is 102021233022013. The reversal of 102021233022011 is 110220332120201.
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 102021233022011 - 242 = 97623186510907 is a prime.
It is a super-2 number, since 2×1020212330220112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102021233022013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11761724165 + ... + 11761732838.
It is an arithmetic number, because the mean of its divisors is an integer number (25511189120838).
Almost surely, 2102021233022011 is an apocalyptic number.
102021233022011 is a deficient number, since it is larger than the sum of its proper divisors (23523461341).
102021233022011 is an equidigital number, since it uses as much as digits as its factorization.
102021233022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23523461340.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 102021233022011 its reverse (110220332120201), we get a palindrome (212241565142212).
The spelling of 102021233022011 in words is "one hundred two trillion, twenty-one billion, two hundred thirty-three million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •