Base | Representation |
---|---|
bin | 10111010000010001100000… |
… | …111101110111101110111000 |
3 | 111102010020111021002000100000 |
4 | 113100101200331313232320 |
5 | 101401121344322143102 |
6 | 1001303425035113000 |
7 | 30354002620052325 |
oct | 2720214075675670 |
9 | 442106437060300 |
10 | 102273388084152 |
11 | 2a65099a347a7a |
12 | b5793268a2760 |
13 | 450b45405703c |
14 | 1b380b6343b4c |
15 | bc55739d401c |
hex | 5d0460f77bb8 |
102273388084152 has 96 divisors (see below), whose sum is σ = 295012826362800. Its totient is φ = 33169747463424.
The previous prime is 102273388084139. The next prime is 102273388084159. The reversal of 102273388084152 is 251480883372201.
102273388084152 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 7 + 338 + 80 + 84 + 152 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102273388084159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 710870877 + ... + 711014732.
Almost surely, 2102273388084152 is an apocalyptic number.
102273388084152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102273388084152 is an abundant number, since it is smaller than the sum of its proper divisors (192739438278648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102273388084152 is a wasteful number, since it uses less digits than its factorization.
102273388084152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1421885667 (or 1421885651 counting only the distinct ones).
The product of its (nonzero) digits is 5160960, while the sum is 54.
The spelling of 102273388084152 in words is "one hundred two trillion, two hundred seventy-three billion, three hundred eighty-eight million, eighty-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •