Base | Representation |
---|---|
bin | 100101001011101011101… |
… | …1111000010000101110100 |
3 | 200002112122210000111110210 |
4 | 1022113113133002011310 |
5 | 1132211424311221122 |
6 | 14511353120145420 |
7 | 1035131526526530 |
oct | 112272737020564 |
9 | 20075583014423 |
10 | 5110331351412 |
11 | 16a0308904911 |
12 | 6a64bb768270 |
13 | 2b0b961180a1 |
14 | 1394ac980bc0 |
15 | 8cde896c40c |
hex | 4a5d77c2174 |
5110331351412 has 24 divisors (see below), whose sum is σ = 13627550270656. Its totient is φ = 1460094671808.
The previous prime is 5110331351393. The next prime is 5110331351431. The reversal of 5110331351412 is 2141531330115.
It is an interprime number because it is at equal distance from previous prime (5110331351393) and next prime (5110331351431).
It is a super-2 number, since 2×51103313514122 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5110331351412.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30418638913 + ... + 30418639080.
Almost surely, 25110331351412 is an apocalyptic number.
It is an amenable number.
5110331351412 is an abundant number, since it is smaller than the sum of its proper divisors (8517218919244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110331351412 is a wasteful number, since it uses less digits than its factorization.
5110331351412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60837278007 (or 60837278005 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 5110331351412 its reverse (2141531330115), we get a palindrome (7251862681527).
The spelling of 5110331351412 in words is "five trillion, one hundred ten billion, three hundred thirty-one million, three hundred fifty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •