Base | Representation |
---|---|
bin | 10110011011011001… |
… | …11100010110111000 |
3 | 1011002011100111002122 |
4 | 23031230330112320 |
5 | 144130001423212 |
6 | 5310453220412 |
7 | 604250124503 |
oct | 131554742670 |
9 | 34064314078 |
10 | 12041045432 |
11 | 5119946719 |
12 | 2400631708 |
13 | 119b806170 |
14 | 82326413a |
15 | 4a717c272 |
hex | 2cdb3c5b8 |
12041045432 has 64 divisors (see below), whose sum is σ = 25202257920. Its totient is φ = 5357835648.
The previous prime is 12041045417. The next prime is 12041045441. The reversal of 12041045432 is 23454014021.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 309113 + ... + 345879.
It is an arithmetic number, because the mean of its divisors is an integer number (393785280).
Almost surely, 212041045432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12041045432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12601128960).
12041045432 is an abundant number, since it is smaller than the sum of its proper divisors (13161212488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12041045432 is a wasteful number, since it uses less digits than its factorization.
12041045432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36900 (or 36896 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 12041045432 its reverse (23454014021), we get a palindrome (35495059453).
The spelling of 12041045432 in words is "twelve billion, forty-one million, forty-five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •