Base | Representation |
---|---|
bin | 101111101010010100… |
… | …1111110010100000101 |
3 | 100210012002101101011000 |
4 | 1133110221332110011 |
5 | 3134104104130431 |
6 | 115004143003513 |
7 | 10252243551555 |
oct | 1372451762405 |
9 | 323162341130 |
10 | 102352020741 |
11 | 3a4530580a3 |
12 | 17a05599599 |
13 | 9861b999a9 |
14 | 4d4d591165 |
15 | 29e09849e6 |
hex | 17d4a7e505 |
102352020741 has 16 divisors (see below), whose sum is σ = 151653096000. Its totient is φ = 68225467824.
The previous prime is 102352020739. The next prime is 102352020773. The reversal of 102352020741 is 147020253201.
102352020741 is a `hidden beast` number, since 102 + 352 + 0 + 207 + 4 + 1 = 666.
It is not a de Polignac number, because 102352020741 - 21 = 102352020739 is a prime.
It is a super-2 number, since 2×1023520207412 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102352020731) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49191 + ... + 455108.
It is an arithmetic number, because the mean of its divisors is an integer number (9478318500).
Almost surely, 2102352020741 is an apocalyptic number.
It is an amenable number.
102352020741 is a deficient number, since it is larger than the sum of its proper divisors (49301075259).
102352020741 is an equidigital number, since it uses as much as digits as its factorization.
102352020741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 511825 (or 511819 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
Adding to 102352020741 its reverse (147020253201), we get a palindrome (249372273942).
The spelling of 102352020741 in words is "one hundred two billion, three hundred fifty-two million, twenty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •