Base | Representation |
---|---|
bin | 10111101001110100011110… |
… | …11110011001000011000101 |
3 | 20211011112102020001020201101 |
4 | 23310322033132121003011 |
5 | 23304201104013011430 |
6 | 302343040305100101 |
7 | 13645630556062603 |
oct | 1364721736310305 |
9 | 224145366036641 |
10 | 52014461063365 |
11 | 1563423328a909 |
12 | 5a00901927631 |
13 | 2303c33c67778 |
14 | cbb7288ac873 |
15 | 603037496dca |
hex | 2f4e8f7990c5 |
52014461063365 has 4 divisors (see below), whose sum is σ = 62417353276044. Its totient is φ = 41611568850688.
The previous prime is 52014461063363. The next prime is 52014461063377. The reversal of 52014461063365 is 56336016441025.
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 23901157432161 + 28113303631204 = 4888881^2 + 5302198^2 .
It is a cyclic number.
It is not a de Polignac number, because 52014461063365 - 21 = 52014461063363 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 (52014461063363) 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, 5201446106332 + ... + 5201446106341.
It is an arithmetic number, because the mean of its divisors is an integer number (15604338319011).
Almost surely, 252014461063365 is an apocalyptic number.
It is an amenable number.
52014461063365 is a deficient number, since it is larger than the sum of its proper divisors (10402892212679).
52014461063365 is a wasteful number, since it uses less digits than its factorization.
52014461063365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10402892212678.
The product of its (nonzero) digits is 1555200, while the sum is 46.
The spelling of 52014461063365 in words is "fifty-two trillion, fourteen billion, four hundred sixty-one million, sixty-three thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •