Base | Representation |
---|---|
bin | 101111100011011100… |
… | …1001010000111010100 |
3 | 100202120222220102011120 |
4 | 1133012321022013110 |
5 | 3133121001321322 |
6 | 114525214003540 |
7 | 10243441125306 |
oct | 1370671120724 |
9 | 322528812146 |
10 | 102121120212 |
11 | 3a34478a111 |
12 | 179601a65b0 |
13 | 98260b3867 |
14 | 4d2aa47976 |
15 | 29ca574a5c |
hex | 17c6e4a1d4 |
102121120212 has 24 divisors (see below), whose sum is σ = 244722685536. Its totient is φ = 33120363168.
The previous prime is 102121120187. The next prime is 102121120229. The reversal of 102121120212 is 212021121201.
It is a junction number, because it is equal to n+sod(n) for n = 102121120191 and 102121120200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115000818 + ... + 115001705.
It is an arithmetic number, because the mean of its divisors is an integer number (10196778564).
Almost surely, 2102121120212 is an apocalyptic number.
102121120212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102121120212 is an abundant number, since it is smaller than the sum of its proper divisors (142601565324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121120212 is a wasteful number, since it uses less digits than its factorization.
102121120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230002567 (or 230002565 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102121120212 its reverse (212021121201), we get a palindrome (314142241413).
The spelling of 102121120212 in words is "one hundred two billion, one hundred twenty-one million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •