Base | Representation |
---|---|
bin | 1010100100001110… |
… | …11000000001111011 |
3 | 112122100001120210220 |
4 | 11102013120001323 |
5 | 43104143214233 |
6 | 2334520111123 |
7 | 260400403002 |
oct | 52207300173 |
9 | 15570046726 |
10 | 5672632443 |
11 | 2451064795 |
12 | 11239054a3 |
13 | 6c530825a |
14 | 3bb553c39 |
15 | 23301eeb3 |
hex | 1521d807b |
5672632443 has 8 divisors (see below), whose sum is σ = 7564933968. Its totient is φ = 3781042944.
The previous prime is 5672632423. The next prime is 5672632447. The reversal of 5672632443 is 3442362765.
5672632443 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5672632443 - 25 = 5672632411 is a prime.
It is a super-2 number, since 2×56726324432 = 64357517666752296498, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5672632395 and 5672632404.
It is not an unprimeable number, because it can be changed into a prime (5672632447) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159130 + ... + 191487.
It is an arithmetic number, because the mean of its divisors is an integer number (945616746).
Almost surely, 25672632443 is an apocalyptic number.
5672632443 is a deficient number, since it is larger than the sum of its proper divisors (1892301525).
5672632443 is a wasteful number, since it uses less digits than its factorization.
5672632443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356013.
The product of its digits is 725760, while the sum is 42.
The square root of 5672632443 is about 75316.8801995940. The cubic root of 5672632443 is about 1783.4525049621.
The spelling of 5672632443 in words is "five billion, six hundred seventy-two million, six hundred thirty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •