Base | Representation |
---|---|
bin | 10110011100111101… |
… | …00100000010110001 |
3 | 1011010001211100011221 |
4 | 23032132210002301 |
5 | 144141314144131 |
6 | 5312040105041 |
7 | 604465521532 |
oct | 131636440261 |
9 | 34101740157 |
10 | 12054053041 |
11 | 5126220508 |
12 | 2404a65181 |
13 | 11a140b984 |
14 | 824c8c689 |
15 | 4a839b411 |
hex | 2ce7a40b1 |
12054053041 has 4 divisors (see below), whose sum is σ = 12096647152. Its totient is φ = 12011458932.
The previous prime is 12054053021. The next prime is 12054053057. The reversal of 12054053041 is 14035045021.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14035045021 = 59 ⋅237882119.
It is a cyclic number.
It is not a de Polignac number, because 12054053041 - 215 = 12054020273 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12054052997 and 12054053015.
It is not an unprimeable number, because it can be changed into a prime (12054053021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21296631 + ... + 21297196.
It is an arithmetic number, because the mean of its divisors is an integer number (3024161788).
Almost surely, 212054053041 is an apocalyptic number.
It is an amenable number.
12054053041 is a deficient number, since it is larger than the sum of its proper divisors (42594111).
12054053041 is an equidigital number, since it uses as much as digits as its factorization.
12054053041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42594110.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 12054053041 its reverse (14035045021), we get a palindrome (26089098062).
The spelling of 12054053041 in words is "twelve billion, fifty-four million, fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •