Base | Representation |
---|---|
bin | 100100110010000101000… |
… | …0000000111101100000011 |
3 | 122220021201122012102120002 |
4 | 1021210022000013230003 |
5 | 1130311321120423133 |
6 | 14430220525110215 |
7 | 1031144100433505 |
oct | 111441200075403 |
9 | 18807648172502 |
10 | 5055344311043 |
11 | 1679a610865a4 |
12 | 6979146b836b |
13 | 2a8942106500 |
14 | 136973ba3d75 |
15 | 8b77b380ce8 |
hex | 4990a007b03 |
5055344311043 has 18 divisors (see below), whose sum is σ = 5722484065956. Its totient is φ = 4463581520112.
The previous prime is 5055344311027. The next prime is 5055344311091. The reversal of 5055344311043 is 3401134435505.
It is not a de Polignac number, because 5055344311043 - 24 = 5055344311027 is a prime.
It is a super-2 number, since 2×50553443110432 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5055344310988 and 5055344311006.
It is not an unprimeable number, because it can be changed into a prime (5055344311093) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 28184021 + ... + 28362822.
It is an arithmetic number, because the mean of its divisors is an integer number (317915781442).
Almost surely, 25055344311043 is an apocalyptic number.
5055344311043 is a deficient number, since it is larger than the sum of its proper divisors (667139754913).
5055344311043 is a wasteful number, since it uses less digits than its factorization.
5055344311043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56546915 (or 56546879 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 5055344311043 its reverse (3401134435505), we get a palindrome (8456478746548).
The spelling of 5055344311043 in words is "five trillion, fifty-five billion, three hundred forty-four million, three hundred eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •