Base | Representation |
---|---|
bin | 10111000000101100011110… |
… | …001011100100010000100100 |
3 | 111021022220011120202021220121 |
4 | 113000230132023210100210 |
5 | 101231101334102303403 |
6 | 555123533425411324 |
7 | 30213443145602350 |
oct | 2700543613442044 |
9 | 437286146667817 |
10 | 101202820744228 |
11 | 2a278969a5a145 |
12 | b42594ba99b44 |
13 | 4461500c41c78 |
14 | 1adc357c00460 |
15 | ba77b6e413bd |
hex | 5c0b1e2e4424 |
101202820744228 has 48 divisors (see below), whose sum is σ = 210029830585344. Its totient is φ = 41767295784480.
The previous prime is 101202820744213. The next prime is 101202820744241. The reversal of 101202820744228 is 822447028202101.
It is a Harshad number since it is a multiple of its sum of digits (43).
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 15 ways as a sum of consecutive naturals, for example, 591854650 + ... + 592025617.
It is an arithmetic number, because the mean of its divisors is an integer number (4375621470528).
Almost surely, 2101202820744228 is an apocalyptic number.
It is an amenable number.
101202820744228 is an abundant number, since it is smaller than the sum of its proper divisors (108827009841116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101202820744228 is a wasteful number, since it uses less digits than its factorization.
101202820744228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1183880392 (or 1183880390 counting only the distinct ones).
The product of its (nonzero) digits is 229376, while the sum is 43.
Adding to 101202820744228 its reverse (822447028202101), we get a palindrome (923649848946329).
The spelling of 101202820744228 in words is "one hundred one trillion, two hundred two billion, eight hundred twenty million, seven hundred forty-four thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •