Base | Representation |
---|---|
bin | 101111100000001100… |
… | …0111110010110010001 |
3 | 100202022101121112222011 |
4 | 1133000120332112101 |
5 | 3132410034120423 |
6 | 114510315342521 |
7 | 10240644602233 |
oct | 1370030762621 |
9 | 322271545864 |
10 | 102012020113 |
11 | 3a299142643 |
12 | 1792b751a41 |
13 | 9809604ca3 |
14 | 4d1a368253 |
15 | 29c0bc3b0d |
hex | 17c063e591 |
102012020113 has 4 divisors (see below), whose sum is σ = 102013060608. Its totient is φ = 102010979620.
The previous prime is 102012020057. The next prime is 102012020147. The reversal of 102012020113 is 311020210201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102012020113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102012020093 and 102012020102.
It is not an unprimeable number, because it can be changed into a prime (102012020153) 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, 355873 + ... + 575038.
It is an arithmetic number, because the mean of its divisors is an integer number (25503265152).
Almost surely, 2102012020113 is an apocalyptic number.
It is an amenable number.
102012020113 is a deficient number, since it is larger than the sum of its proper divisors (1040495).
102012020113 is an equidigital number, since it uses as much as digits as its factorization.
102012020113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1040494.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 102012020113 its reverse (311020210201), we get a palindrome (413032230314).
The spelling of 102012020113 in words is "one hundred two billion, twelve million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •