Base | Representation |
---|---|
bin | 101111100000001001… |
… | …0000010010000100001 |
3 | 100202022021012010210002 |
4 | 1133000102002100201 |
5 | 3132404102413441 |
6 | 114510212345345 |
7 | 10240623255113 |
oct | 1370022022041 |
9 | 322267163702 |
10 | 102010201121 |
11 | 3a29810aa44 |
12 | 1792b015255 |
13 | 980911906a |
14 | 4d1a0133b3 |
15 | 29c0964b9b |
hex | 17c0482421 |
102010201121 has 8 divisors (see below), whose sum is σ = 102756951360. Its totient is φ = 101263634928.
The previous prime is 102010201103. The next prime is 102010201127. The reversal of 102010201121 is 121102010201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102010201121 - 218 = 102009938977 is a prime.
It is a super-2 number, since 2×1020102011212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102010201127) 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, 1186820 + ... + 1269866.
It is an arithmetic number, because the mean of its divisors is an integer number (12844618920).
Almost surely, 2102010201121 is an apocalyptic number.
It is an amenable number.
102010201121 is a deficient number, since it is larger than the sum of its proper divisors (746750239).
102010201121 is an equidigital number, since it uses as much as digits as its factorization.
102010201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92023.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102010201121 its reverse (121102010201), we get a palindrome (223112211322).
It can be divided in two parts, 102010201 and 121, that multiplied together give a palindrome (12343234321).
The spelling of 102010201121 in words is "one hundred two billion, ten million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •