Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …010100110001010001001101 |
3 | 111101120120120101100001021000 |
4 | 113032002222110301101031 |
5 | 101341113230000013401 |
6 | 1001105140320130513 |
7 | 30336632540626035 |
oct | 2716025224612115 |
9 | 441516511301230 |
10 | 102120000001101 |
11 | 2a5a1937812995 |
12 | b553659466a39 |
13 | 44c9b4a895014 |
14 | 1b308c4a088c5 |
15 | bc1597753186 |
hex | 5ce0aa53144d |
102120000001101 has 8 divisors (see below), whose sum is σ = 151288888890560. Its totient is φ = 68080000000716.
The previous prime is 102120000001099. The next prime is 102120000001303. The reversal of 102120000001101 is 101100000021201.
It is a happy number.
It is not a de Polignac number, because 102120000001101 - 21 = 102120000001099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120000001001) 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, 1891111111105 + ... + 1891111111158.
It is an arithmetic number, because the mean of its divisors is an integer number (18911111111320).
Almost surely, 2102120000001101 is an apocalyptic number.
It is an amenable number.
102120000001101 is a deficient number, since it is larger than the sum of its proper divisors (49168888889459).
102120000001101 is an equidigital number, since it uses as much as digits as its factorization.
102120000001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3782222222272 (or 3782222222266 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102120000001101 its reverse (101100000021201), we get a palindrome (203220000022302).
The spelling of 102120000001101 in words is "one hundred two trillion, one hundred twenty billion, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •