Base | Representation |
---|---|
bin | 1001111101010111… |
… | …01101011000100000 |
3 | 111210121121001220010 |
4 | 10332223231120200 |
5 | 41422213102033 |
6 | 2242312244520 |
7 | 246331313220 |
oct | 47653553040 |
9 | 14717531803 |
10 | 5346612768 |
11 | 22a4029342 |
12 | 10526a0740 |
13 | 6728ca0c3 |
14 | 38a12a080 |
15 | 2145c1863 |
hex | 13eaed620 |
5346612768 has 96 divisors (see below), whose sum is σ = 16884080640. Its totient is φ = 1447200000.
The previous prime is 5346612731. The next prime is 5346612773. The reversal of 5346612768 is 8672166435.
It is a tau number, because it is divible by the number of its divisors (96).
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 196608 + ... + 222143.
It is an arithmetic number, because the mean of its divisors is an integer number (175875840).
Almost surely, 25346612768 is an apocalyptic number.
It is an amenable number.
5346612768 is an abundant number, since it is smaller than the sum of its proper divisors (11537467872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5346612768 is a wasteful number, since it uses less digits than its factorization.
5346612768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418790 (or 418782 counting only the distinct ones).
The product of its digits is 1451520, while the sum is 48.
The square root of 5346612768 is about 73120.5358842507. The cubic root of 5346612768 is about 1748.6098094564.
The spelling of 5346612768 in words is "five billion, three hundred forty-six million, six hundred twelve thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •