Base | Representation |
---|---|
bin | 101111100011011100… |
… | …0101111001101011010 |
3 | 100202120222200211000000 |
4 | 1133012320233031122 |
5 | 3133120434310020 |
6 | 114525211353430 |
7 | 10243440156105 |
oct | 1370670571532 |
9 | 322528624000 |
10 | 102121010010 |
11 | 3a344714338 |
12 | 17960152876 |
13 | 9826075656 |
14 | 4d2aa1973c |
15 | 29ca552090 |
hex | 17c6e2f35a |
102121010010 has 56 divisors (see below), whose sum is σ = 275600671380. Its totient is φ = 27232267392.
The previous prime is 102121009933. The next prime is 102121010011. The reversal of 102121010010 is 10010121201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 90322488369 + 11798521641 = 300537^2 + 108621^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102121009974 and 102121010001.
It is not an unprimeable number, because it can be changed into a prime (102121010011) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 6996895 + ... + 7011474.
Almost surely, 2102121010010 is an apocalyptic number.
102121010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102121010010 is an abundant number, since it is smaller than the sum of its proper divisors (173479661370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121010010 is an equidigital number, since it uses as much as digits as its factorization.
102121010010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14008394 (or 14008379 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102121010010 its reverse (10010121201), we get a palindrome (112131131211).
The spelling of 102121010010 in words is "one hundred two billion, one hundred twenty-one million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •