Base | Representation |
---|---|
bin | 10111010011010100100011… |
… | …00000101011111001011100 |
3 | 20201102122000100100110202001 |
4 | 23221222101200223321130 |
5 | 23204014342140343022 |
6 | 300551550311212044 |
7 | 13536032454625135 |
oct | 1351522140537134 |
9 | 221378010313661 |
10 | 51241401106012 |
11 | 153663a1077977 |
12 | 58b6b15677024 |
13 | 2279074438240 |
14 | c9215041cc8c |
15 | 5dcd8e344b27 |
hex | 2e9a9182be5c |
51241401106012 has 48 divisors (see below), whose sum is σ = 97136900209440. Its totient is φ = 23511502801152.
The previous prime is 51241401106009. The next prime is 51241401106013. The reversal of 51241401106012 is 21060110414215.
51241401106012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51241401106013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2610298 + ... + 10454494.
It is an arithmetic number, because the mean of its divisors is an integer number (2023685421030).
Almost surely, 251241401106012 is an apocalyptic number.
51241401106012 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
51241401106012 is a deficient number, since it is larger than the sum of its proper divisors (45895499103428).
51241401106012 is a wasteful number, since it uses less digits than its factorization.
51241401106012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7844950 (or 7844948 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 28.
The spelling of 51241401106012 in words is "fifty-one trillion, two hundred forty-one billion, four hundred one million, one hundred six thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •