Base | Representation |
---|---|
bin | 10001011000111100… |
… | …010011000111001000 |
3 | 1210012021210111021100 |
4 | 101120330103013020 |
5 | 301220022233422 |
6 | 12324451141400 |
7 | 1230465662052 |
oct | 213074230710 |
9 | 53167714240 |
10 | 18672071112 |
11 | 7a11996432 |
12 | 37512a4860 |
13 | 19b75415b6 |
14 | c91bb48d2 |
15 | 7443b07ac |
hex | 458f131c8 |
18672071112 has 24 divisors (see below), whose sum is σ = 50570192790. Its totient is φ = 6224023680.
The previous prime is 18672071101. The next prime is 18672071141. The reversal of 18672071112 is 21117027681.
It can be written as a sum of positive squares in only one way, i.e., 18210422916 + 461648196 = 134946^2 + 21486^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×186720711122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 129667089 + ... + 129667232.
Almost surely, 218672071112 is an apocalyptic number.
18672071112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
18672071112 is an abundant number, since it is smaller than the sum of its proper divisors (31898121678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18672071112 is a wasteful number, since it uses less digits than its factorization.
18672071112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259334333 (or 259334326 counting only the distinct ones).
The product of its (nonzero) digits is 9408, while the sum is 36.
Adding to 18672071112 its reverse (21117027681), we get a palindrome (39789098793).
The spelling of 18672071112 in words is "eighteen billion, six hundred seventy-two million, seventy-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •