Base | Representation |
---|---|
bin | 100101001011101110011… |
… | …1100101001010011111000 |
3 | 200002112220011110202010111 |
4 | 1022113130330221103320 |
5 | 1132212121242002222 |
6 | 14511410152354104 |
7 | 1035134021530510 |
oct | 112273474512370 |
9 | 20075804422114 |
10 | 5110423000312 |
11 | 16a0355612003 |
12 | 6a65263a5934 |
13 | 2b0bac0c66c6 |
14 | 1394babda840 |
15 | 8ce01a22777 |
hex | 4a5dcf294f8 |
5110423000312 has 16 divisors (see below), whose sum is σ = 10950906429360. Its totient is φ = 2190181285824.
The previous prime is 5110423000289. The next prime is 5110423000337. The reversal of 5110423000312 is 2130003240115.
It is a happy number.
It is a super-2 number, since 2×51104230003122 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 45628776733 + ... + 45628776844.
It is an arithmetic number, because the mean of its divisors is an integer number (684431651835).
Almost surely, 25110423000312 is an apocalyptic number.
It is an amenable number.
5110423000312 is an abundant number, since it is smaller than the sum of its proper divisors (5840483429048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110423000312 is a wasteful number, since it uses less digits than its factorization.
5110423000312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91257553590 (or 91257553586 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 5110423000312 its reverse (2130003240115), we get a palindrome (7240426240427).
The spelling of 5110423000312 in words is "five trillion, one hundred ten billion, four hundred twenty-three million, three hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •