Base | Representation |
---|---|
bin | 100101011010000000101… |
… | …1110011001101011100101 |
3 | 200012111002010210021120201 |
4 | 1022310001132121223211 |
5 | 1133212433223200122 |
6 | 14533442232030501 |
7 | 1040301160033663 |
oct | 112640136315345 |
9 | 20174063707521 |
10 | 5141100600037 |
11 | 1702368295806 |
12 | 6b0468232431 |
13 | 2b3a5a98708c |
14 | 13ab8b22bc33 |
15 | 8dae9d96a27 |
hex | 4ad01799ae5 |
5141100600037 has 4 divisors (see below), whose sum is σ = 5144180949580. Its totient is φ = 5138020250496.
The previous prime is 5141100600029. The next prime is 5141100600043. The reversal of 5141100600037 is 7300060011415.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1100654872641 + 4040445727396 = 1049121^2 + 2010086^2 .
It is a cyclic number.
It is not a de Polignac number, because 5141100600037 - 23 = 5141100600029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5141100599978 and 5141100600014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5141100600047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1540172268 + ... + 1540175605.
It is an arithmetic number, because the mean of its divisors is an integer number (1286045237395).
Almost surely, 25141100600037 is an apocalyptic number.
It is an amenable number.
5141100600037 is a deficient number, since it is larger than the sum of its proper divisors (3080349543).
5141100600037 is a wasteful number, since it uses less digits than its factorization.
5141100600037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3080349542.
The product of its (nonzero) digits is 2520, while the sum is 28.
The spelling of 5141100600037 in words is "five trillion, one hundred forty-one billion, one hundred million, six hundred thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •