Base | Representation |
---|---|
bin | 10110100101111010… |
… | …11010101111100000 |
3 | 1011022022022202101120 |
4 | 23102331122233200 |
5 | 144320042002042 |
6 | 5323323532240 |
7 | 606400632456 |
oct | 132275325740 |
9 | 34268282346 |
10 | 12129250272 |
11 | 5164711287 |
12 | 242608a080 |
13 | 11b3b79c89 |
14 | 830c649d6 |
15 | 4aeca1dec |
hex | 2d2f5abe0 |
12129250272 has 48 divisors (see below), whose sum is σ = 31913263872. Its totient is φ = 4033688960.
The previous prime is 12129250213. The next prime is 12129250277. The reversal of 12129250272 is 27205292121.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-3 number, since 3×121292502723 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12129250277) 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 7 ways as a sum of consecutive naturals, for example, 105198 + ... + 187949.
It is an arithmetic number, because the mean of its divisors is an integer number (664859664).
Almost surely, 212129250272 is an apocalyptic number.
12129250272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12129250272 is an abundant number, since it is smaller than the sum of its proper divisors (19784013600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12129250272 is a wasteful number, since it uses less digits than its factorization.
12129250272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293591 (or 293583 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 12129250272 in words is "twelve billion, one hundred twenty-nine million, two hundred fifty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •