Base | Representation |
---|---|
bin | 1001111011000110… |
… | …11101100100001100 |
3 | 111202021221212020220 |
4 | 10331203131210030 |
5 | 41402341023422 |
6 | 2240354311340 |
7 | 246011323062 |
oct | 47543354414 |
9 | 14667855226 |
10 | 5327673612 |
11 | 2294373048 |
12 | 1048288550 |
13 | 66b9c87c1 |
14 | 3877da032 |
15 | 212acee5c |
hex | 13d8dd90c |
5327673612 has 12 divisors (see below), whose sum is σ = 12431238456. Its totient is φ = 1775891200.
The previous prime is 5327673601. The next prime is 5327673613. The reversal of 5327673612 is 2163767235.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×53276736122 = 56768212232002253088, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5327673613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221986389 + ... + 221986412.
It is an arithmetic number, because the mean of its divisors is an integer number (1035936538).
Almost surely, 25327673612 is an apocalyptic number.
It is an amenable number.
5327673612 is an abundant number, since it is smaller than the sum of its proper divisors (7103564844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5327673612 is a wasteful number, since it uses less digits than its factorization.
5327673612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443972808 (or 443972806 counting only the distinct ones).
The product of its digits is 317520, while the sum is 42.
The square root of 5327673612 is about 72990.9145853099. The cubic root of 5327673612 is about 1746.5426829780.
The spelling of 5327673612 in words is "five billion, three hundred twenty-seven million, six hundred seventy-three thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •