Base | Representation |
---|---|
bin | 100100110000001101001… |
… | …1000000001100000100001 |
3 | 122212220100110100202210112 |
4 | 1021200122120001200201 |
5 | 1130230102423422340 |
6 | 14424313552541105 |
7 | 1030642342643324 |
oct | 111403230014041 |
9 | 18786313322715 |
10 | 5051324045345 |
11 | 1678288810466 |
12 | 696b92251795 |
13 | 2a845123a776 |
14 | 1366b1c967bb |
15 | 8b5e3456065 |
hex | 4981a601821 |
5051324045345 has 4 divisors (see below), whose sum is σ = 6061588854420. Its totient is φ = 4041059236272.
The previous prime is 5051324045311. The next prime is 5051324045381. The reversal of 5051324045345 is 5435404231505.
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 1149134688529 + 3902189356816 = 1071977^2 + 1975396^2 .
It is a cyclic number.
It is not a de Polignac number, because 5051324045345 - 210 = 5051324044321 is a prime.
It is a super-2 number, since 2×50513240453452 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505132404530 + ... + 505132404539.
It is an arithmetic number, because the mean of its divisors is an integer number (1515397213605).
Almost surely, 25051324045345 is an apocalyptic number.
It is an amenable number.
5051324045345 is a deficient number, since it is larger than the sum of its proper divisors (1010264809075).
5051324045345 is a wasteful number, since it uses less digits than its factorization.
5051324045345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010264809074.
The product of its (nonzero) digits is 720000, while the sum is 41.
The spelling of 5051324045345 in words is "five trillion, fifty-one billion, three hundred twenty-four million, forty-five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •