Base | Representation |
---|---|
bin | 10111000011111100… |
… | …01101111101000000 |
3 | 1011221212020222100000 |
4 | 23201332031331000 |
5 | 200324031241042 |
6 | 5404322200000 |
7 | 615546524505 |
oct | 134176157500 |
9 | 34855228300 |
10 | 12381118272 |
11 | 5283900456 |
12 | 24964b3000 |
13 | 12240c49b3 |
14 | 8564a94ac |
15 | 4c6e5474c |
hex | 2e1f8df40 |
12381118272 has 336 divisors, whose sum is σ = 38704300544. Its totient is φ = 3919104000.
The previous prime is 12381118261. The next prime is 12381118273. The reversal of 12381118272 is 27281118321.
12381118272 is a `hidden beast` number, since 1 + 2 + 381 + 1 + 1 + 8 + 272 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12381118273) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29408622 + ... + 29409042.
Almost surely, 212381118272 is an apocalyptic number.
12381118272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12381118272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19352150272).
12381118272 is an abundant number, since it is smaller than the sum of its proper divisors (26323182272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12381118272 is an equidigital number, since it uses as much as digits as its factorization.
12381118272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540 (or 518 counting only the distinct ones).
The product of its digits is 10752, while the sum is 36.
The spelling of 12381118272 in words is "twelve billion, three hundred eighty-one million, one hundred eighteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •