Base | Representation |
---|---|
bin | 10110100011000010… |
… | …11101110001001101 |
3 | 1011020121222002202022 |
4 | 23101201131301031 |
5 | 144242404123141 |
6 | 5321103135525 |
7 | 605656016105 |
oct | 132141356115 |
9 | 34217862668 |
10 | 12105145421 |
11 | 5152047a16 |
12 | 2419ba45a5 |
13 | 11abb8a355 |
14 | 82b98c205 |
15 | 4acadeb4b |
hex | 2d185dc4d |
12105145421 has 8 divisors (see below), whose sum is σ = 12165398784. Its totient is φ = 12044988000.
The previous prime is 12105145417. The next prime is 12105145439. The reversal of 12105145421 is 12454150121.
It is a happy number.
12105145421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12105145421 - 22 = 12105145417 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12105145411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 235940 + ... + 282626.
It is an arithmetic number, because the mean of its divisors is an integer number (1520674848).
Almost surely, 212105145421 is an apocalyptic number.
It is an amenable number.
12105145421 is a deficient number, since it is larger than the sum of its proper divisors (60253363).
12105145421 is a wasteful number, since it uses less digits than its factorization.
12105145421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47971.
The product of its (nonzero) digits is 1600, while the sum is 26.
Adding to 12105145421 its reverse (12454150121), we get a palindrome (24559295542).
The spelling of 12105145421 in words is "twelve billion, one hundred five million, one hundred forty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •