Base | Representation |
---|---|
bin | 101111100000011011… |
… | …1110011010000000010 |
3 | 100202022221211010000210 |
4 | 1133000313303100002 |
5 | 3132414121213442 |
6 | 114511204454550 |
7 | 10241103360102 |
oct | 1370067632002 |
9 | 322287733023 |
10 | 102020101122 |
11 | 3a2a2761a65 |
12 | 179323aa456 |
13 | 980b1a4254 |
14 | 4d1b46d202 |
15 | 29c176d19c |
hex | 17c0df3402 |
102020101122 has 8 divisors (see below), whose sum is σ = 204040202256. Its totient is φ = 34006700372.
The previous prime is 102020101097. The next prime is 102020101129. The reversal of 102020101122 is 221101020201.
It is a sphenic number, since it is the product of 3 distinct primes.
102020101122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 102020101098 and 102020101107.
It is not an unprimeable number, because it can be changed into a prime (102020101129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8501675088 + ... + 8501675099.
It is an arithmetic number, because the mean of its divisors is an integer number (25505025282).
Almost surely, 2102020101122 is an apocalyptic number.
102020101122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020101122 is a wasteful number, since it uses less digits than its factorization.
102020101122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17003350192.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102020101122 its reverse (221101020201), we get a palindrome (323121121323).
The spelling of 102020101122 in words is "one hundred two billion, twenty million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •