Base | Representation |
---|---|
bin | 10111001100010100111000… |
… | …111110000010100110111011 |
3 | 111101011022100002211220122202 |
4 | 113030110320332002212323 |
5 | 101332200332312203121 |
6 | 1000535044500540415 |
7 | 30325260654201356 |
oct | 2714247076024673 |
9 | 441138302756582 |
10 | 102002134100411 |
11 | 2a556953567206 |
12 | b5348443b170b |
13 | 44bb9b587760c |
14 | 1b28d02ca729d |
15 | bbd499ced40b |
hex | 5cc538f829bb |
102002134100411 has 4 divisors (see below), whose sum is σ = 102002783278872. Its totient is φ = 102001484921952.
The previous prime is 102002134100327. The next prime is 102002134100527. The reversal of 102002134100411 is 114001431200201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102002134100411 - 238 = 101727256193467 is a prime.
It is a super-2 number, since 2×1020021341004112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102002134160411) 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, 324353486 + ... + 324667811.
It is an arithmetic number, because the mean of its divisors is an integer number (25500695819718).
Almost surely, 2102002134100411 is an apocalyptic number.
102002134100411 is a deficient number, since it is larger than the sum of its proper divisors (649178461).
102002134100411 is an equidigital number, since it uses as much as digits as its factorization.
102002134100411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 649178460.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 102002134100411 its reverse (114001431200201), we get a palindrome (216003565300612).
The spelling of 102002134100411 in words is "one hundred two trillion, two billion, one hundred thirty-four million, one hundred thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •