Base | Representation |
---|---|
bin | 10111001010001101… |
… | …11001011011010000 |
3 | 1012002112020200101101 |
4 | 23211012321123100 |
5 | 200431013201021 |
6 | 5413441514144 |
7 | 620055630340 |
oct | 134506713320 |
9 | 35075220341 |
10 | 12433725136 |
11 | 53005717a8 |
12 | 24b0042954 |
13 | 1231c83811 |
14 | 85d480d20 |
15 | 4cb896a91 |
hex | 2e51b96d0 |
12433725136 has 40 divisors (see below), whose sum is σ = 27998475840. Its totient is φ = 5238418944.
The previous prime is 12433725127. The next prime is 12433725151. The reversal of 12433725136 is 63152733421.
12433725136 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12433725095 and 12433725104.
It is a congruent number.
It is an unprimeable number.
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, 934201 + ... + 947416.
It is an arithmetic number, because the mean of its divisors is an integer number (699961896).
Almost surely, 212433725136 is an apocalyptic number.
12433725136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
12433725136 is an abundant number, since it is smaller than the sum of its proper divisors (15564750704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12433725136 is a wasteful number, since it uses less digits than its factorization.
12433725136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1881691 (or 1881685 counting only the distinct ones).
The product of its digits is 90720, while the sum is 37.
The spelling of 12433725136 in words is "twelve billion, four hundred thirty-three million, seven hundred twenty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •