Base | Representation |
---|---|
bin | 100100101000101111111… |
… | …1111010111000000101001 |
3 | 122211101000120002110200012 |
4 | 1021101133333113000221 |
5 | 1124444304400201003 |
6 | 14413105045421305 |
7 | 1026534504536003 |
oct | 111213777270051 |
9 | 18741016073605 |
10 | 5035312115753 |
11 | 16715114677a7 |
12 | 693a63a0a835 |
13 | 2a6a9bb6860a |
14 | 1359d34db373 |
15 | 8aea78a58d8 |
hex | 4945ffd7029 |
5035312115753 has 2 divisors, whose sum is σ = 5035312115754. Its totient is φ = 5035312115752.
The previous prime is 5035312115749. The next prime is 5035312115783. The reversal of 5035312115753 is 3575112135305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3503886065689 + 1531426050064 = 1871867^2 + 1237508^2 .
It is a cyclic number.
It is not a de Polignac number, because 5035312115753 - 22 = 5035312115749 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5035312115753.
It is not a weakly prime, because it can be changed into another prime (5035312115783) 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 as a sum of consecutive naturals, namely, 2517656057876 + 2517656057877.
It is an arithmetic number, because the mean of its divisors is an integer number (2517656057877).
Almost surely, 25035312115753 is an apocalyptic number.
It is an amenable number.
5035312115753 is a deficient number, since it is larger than the sum of its proper divisors (1).
5035312115753 is an equidigital number, since it uses as much as digits as its factorization.
5035312115753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 236250, while the sum is 41.
The spelling of 5035312115753 in words is "five trillion, thirty-five billion, three hundred twelve million, one hundred fifteen thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •