Base | Representation |
---|---|
bin | 101111101100101110… |
… | …1100001011000101001 |
3 | 100210101201002101112211 |
4 | 1133121131201120221 |
5 | 3134240224030401 |
6 | 115020143005121 |
7 | 10254243044662 |
oct | 1373135413051 |
9 | 323351071484 |
10 | 102432642601 |
11 | 3a494613533 |
12 | 17a285997a1 |
13 | 98757b7133 |
14 | 4d5a17a369 |
15 | 29e7aac951 |
hex | 17d9761629 |
102432642601 has 9 divisors (see below), whose sum is σ = 102899146359. Its totient is φ = 101968248600.
The previous prime is 102432642577. The next prime is 102432642629. The reversal of 102432642601 is 106246234201.
The square root of 102432642601 is 320051.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 93942863001 + 8489779600 = 306501^2 + 92140^2 .
It is not a de Polignac number, because 102432642601 - 29 = 102432642089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102432642701) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 86733231 + ... + 86734411.
Almost surely, 2102432642601 is an apocalyptic number.
102432642601 is the 320051-st square number.
102432642601 is the 160026-th centered octagonal number.
It is an amenable number.
102432642601 is a deficient number, since it is larger than the sum of its proper divisors (466503758).
102432642601 is an frugal number, since it uses more digits than its factorization.
102432642601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2904 (or 1452 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 102432642601 its reverse (106246234201), we get a palindrome (208678876802).
The spelling of 102432642601 in words is "one hundred two billion, four hundred thirty-two million, six hundred forty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •