Base | Representation |
---|---|
bin | 100101001001010011011… |
… | …0101100100111011111111 |
3 | 200002001110120111122010222 |
4 | 1022102212311210323333 |
5 | 1132120442333213211 |
6 | 14505150014451555 |
7 | 1034561054536055 |
oct | 112224665447377 |
9 | 20061416448128 |
10 | 5105220210431 |
11 | 1699125796a60 |
12 | 6a5513b03bbb |
13 | 2b0560244a03 |
14 | 139145c2c1d5 |
15 | 8cbe9db01db |
hex | 4a4a6d64eff |
5105220210431 has 32 divisors (see below), whose sum is σ = 5983820697600. Its totient is φ = 4306365324000.
The previous prime is 5105220210403. The next prime is 5105220210437. The reversal of 5105220210431 is 1340120225015.
It is a cyclic number.
It is not a de Polignac number, because 5105220210431 - 26 = 5105220210367 is a prime.
It is a super-2 number, since 2×51052202104312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5105220210431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105220210437) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2577836 + ... + 4105566.
It is an arithmetic number, because the mean of its divisors is an integer number (186994396800).
Almost surely, 25105220210431 is an apocalyptic number.
5105220210431 is a deficient number, since it is larger than the sum of its proper divisors (878600487169).
5105220210431 is a wasteful number, since it uses less digits than its factorization.
5105220210431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1528091.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 5105220210431 its reverse (1340120225015), we get a palindrome (6445340435446).
The spelling of 5105220210431 in words is "five trillion, one hundred five billion, two hundred twenty million, two hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •