Base | Representation |
---|---|
bin | 101111100100011110… |
… | …1100001001010101010 |
3 | 100202200102012020002120 |
4 | 1133020331201022222 |
5 | 3133203342131032 |
6 | 114532453412110 |
7 | 10244342060064 |
oct | 1371075411252 |
9 | 322612166076 |
10 | 102155817642 |
11 | 3a36232887a |
12 | 1796b93a036 |
13 | 9830341998 |
14 | 4d314ba734 |
15 | 29cd62a62c |
hex | 17c8f612aa |
102155817642 has 32 divisors (see below), whose sum is σ = 204828841152. Its totient is φ = 33965791104.
The previous prime is 102155817637. The next prime is 102155817649. The reversal of 102155817642 is 246718551201.
It is a happy number.
It is a super-2 number, since 2×1021558176422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102155817594 and 102155817603.
It is not an unprimeable number, because it can be changed into a prime (102155817649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12397948 + ... + 12406184.
It is an arithmetic number, because the mean of its divisors is an integer number (6400901286).
Almost surely, 2102155817642 is an apocalyptic number.
102155817642 is an abundant number, since it is smaller than the sum of its proper divisors (102673023510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102155817642 is a wasteful number, since it uses less digits than its factorization.
102155817642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13222.
The product of its (nonzero) digits is 134400, while the sum is 42.
The spelling of 102155817642 in words is "one hundred two billion, one hundred fifty-five million, eight hundred seventeen thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •