Base | Representation |
---|---|
bin | 101111100011001101… |
… | …1110101100001000010 |
3 | 100202120110102220012200 |
4 | 1133012123311201002 |
5 | 3133112014334131 |
6 | 114524341134030 |
7 | 10243315602456 |
oct | 1370633654102 |
9 | 322513386180 |
10 | 102113433666 |
11 | 3a34040a0a2 |
12 | 179596ba316 |
13 | 9824621cca |
14 | 4d29a06666 |
15 | 29c9a572e6 |
hex | 17c66f5842 |
102113433666 has 12 divisors (see below), whose sum is σ = 221245772982. Its totient is φ = 34037811216.
The previous prime is 102113433619. The next prime is 102113433689. The reversal of 102113433666 is 666334311201.
102113433666 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 91730842641 + 10382591025 = 302871^2 + 101895^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 102113433666.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 2836484251 + ... + 2836484286.
Almost surely, 2102113433666 is an apocalyptic number.
102113433666 is an abundant number, since it is smaller than the sum of its proper divisors (119132339316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102113433666 is a wasteful number, since it uses less digits than its factorization.
102113433666 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5672968545 (or 5672968542 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 36.
Adding to 102113433666 its reverse (666334311201), we get a palindrome (768447744867).
The spelling of 102113433666 in words is "one hundred two billion, one hundred thirteen million, four hundred thirty-three thousand, six hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •