Base | Representation |
---|---|
bin | 1001001100001011… |
… | …01111011001111101 |
3 | 110201212012111100200 |
4 | 10212011233121331 |
5 | 40101101201042 |
6 | 2133332514113 |
7 | 233161235205 |
oct | 44605573175 |
9 | 13655174320 |
10 | 4934006397 |
11 | 2102133041 |
12 | b5847b939 |
13 | 608293818 |
14 | 34b403405 |
15 | 1dd26cc4c |
hex | 12616f67d |
4934006397 has 12 divisors (see below), whose sum is σ = 7158297120. Its totient is φ = 3274845768.
The previous prime is 4934006387. The next prime is 4934006419. The reversal of 4934006397 is 7936004394.
4934006397 is a `hidden beast` number, since 4 + 9 + 3 + 4 + 0 + 0 + 639 + 7 = 666.
It is not a de Polignac number, because 4934006397 - 214 = 4933990013 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4934006377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1205497 + ... + 1209582.
It is an arithmetic number, because the mean of its divisors is an integer number (596524760).
Almost surely, 24934006397 is an apocalyptic number.
It is an amenable number.
4934006397 is a deficient number, since it is larger than the sum of its proper divisors (2224290723).
4934006397 is a wasteful number, since it uses less digits than its factorization.
4934006397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2415312 (or 2415309 counting only the distinct ones).
The product of its (nonzero) digits is 489888, while the sum is 45.
The square root of 4934006397 is about 70242.4828504802. The cubic root of 4934006397 is about 1702.4194381850.
The spelling of 4934006397 in words is "four billion, nine hundred thirty-four million, six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •