Base | Representation |
---|---|
bin | 100110100110010101101… |
… | …1010100110010001001101 |
3 | 200210011011110220002221201 |
4 | 1031030223122212101031 |
5 | 1143404131312101331 |
6 | 15141031143425501 |
7 | 1055163111340552 |
oct | 115145332462115 |
9 | 20704143802851 |
10 | 5305013003341 |
11 | 17659305a2427 |
12 | 718192155291 |
13 | 2c635065532c |
14 | 144a9a5b2a29 |
15 | 92ee0054a61 |
hex | 4d32b6a644d |
5305013003341 has 4 divisors (see below), whose sum is σ = 5305019120352. Its totient is φ = 5305006886332.
The previous prime is 5305013003267. The next prime is 5305013003363. The reversal of 5305013003341 is 1433003105035.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5305013003341 - 235 = 5270653264973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5305013009341) 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, 1489231 + ... + 3581596.
It is an arithmetic number, because the mean of its divisors is an integer number (1326254780088).
Almost surely, 25305013003341 is an apocalyptic number.
It is an amenable number.
5305013003341 is a deficient number, since it is larger than the sum of its proper divisors (6117011).
5305013003341 is a wasteful number, since it uses less digits than its factorization.
5305013003341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6117010.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 5305013003341 its reverse (1433003105035), we get a palindrome (6738016108376).
The spelling of 5305013003341 in words is "five trillion, three hundred five billion, thirteen million, three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •