Base | Representation |
---|---|
bin | 10110011100110111… |
… | …10011110001010001 |
3 | 1011010000110122202121 |
4 | 23032123303301101 |
5 | 144141123043100 |
6 | 5312012414241 |
7 | 604456423531 |
oct | 131633636121 |
9 | 34100418677 |
10 | 12053331025 |
11 | 5125877aaa |
12 | 2404777381 |
13 | 11a1218148 |
14 | 824b414c1 |
15 | 4a82a751a |
hex | 2ce6f3c51 |
12053331025 has 12 divisors (see below), whose sum is σ = 14965489692. Its totient is φ = 9630175040.
The previous prime is 12053331019. The next prime is 12053331029. The reversal of 12053331025 is 52013335021.
It can be written as a sum of positive squares in 6 ways, for example, as 3028521024 + 9024810001 = 55032^2 + 94999^2 .
It is not a de Polignac number, because 12053331025 - 223 = 12044942417 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12053331029) 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 11 ways as a sum of consecutive naturals, for example, 292534 + ... + 331183.
It is an arithmetic number, because the mean of its divisors is an integer number (1247124141).
Almost surely, 212053331025 is an apocalyptic number.
It is an amenable number.
12053331025 is a deficient number, since it is larger than the sum of its proper divisors (2912158667).
12053331025 is an equidigital number, since it uses as much as digits as its factorization.
12053331025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 624500 (or 624495 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 12053331025 its reverse (52013335021), we get a palindrome (64066666046).
The spelling of 12053331025 in words is "twelve billion, fifty-three million, three hundred thirty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •