Base | Representation |
---|---|
bin | 10111010010110000101110… |
… | …110000101000100100010000 |
3 | 111102201120202111121222011212 |
4 | 113102300232300220210100 |
5 | 101411422004134221300 |
6 | 1001514140535155252 |
7 | 30402234233126162 |
oct | 2722605660504420 |
9 | 442646674558155 |
10 | 102444344445200 |
11 | 2a7074477a237a |
12 | b5a6497815b28 |
13 | 45215ca17c324 |
14 | 1b42493008932 |
15 | bc9c2c290935 |
hex | 5d2c2ec28910 |
102444344445200 has 60 divisors (see below), whose sum is σ = 256823517445248. Its totient is φ = 39196097001600.
The previous prime is 102444344445173. The next prime is 102444344445203. The reversal of 102444344445200 is 2544443444201.
It is not an unprimeable number, because it can be changed into a prime (102444344445203) 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 11 ways as a sum of consecutive naturals, for example, 5567618216 + ... + 5567636615.
Almost surely, 2102444344445200 is an apocalyptic number.
102444344445200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102444344445200 is an abundant number, since it is smaller than the sum of its proper divisors (154379173000048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102444344445200 is a wasteful number, since it uses less digits than its factorization.
102444344445200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11135254872 (or 11135254861 counting only the distinct ones).
The product of its (nonzero) digits is 983040, while the sum is 41.
Adding to 102444344445200 its reverse (2544443444201), we get a palindrome (104988787889401).
The spelling of 102444344445200 in words is "one hundred two trillion, four hundred forty-four billion, three hundred forty-four million, four hundred forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •