Base | Representation |
---|---|
bin | 100011101101110010100… |
… | …0011110000101100101101 |
3 | 122101021012102211001212012 |
4 | 1013123211003300230231 |
5 | 1120411002034323042 |
6 | 14235005034451005 |
7 | 1014433024224452 |
oct | 107334503605455 |
9 | 18337172731765 |
10 | 4908695620397 |
11 | 16228477877a8 |
12 | 673408293a65 |
13 | 297b70c6274a |
14 | 12d821547829 |
15 | 87a46adbe82 |
hex | 476e50f0b2d |
4908695620397 has 4 divisors (see below), whose sum is σ = 4908846323520. Its totient is φ = 4908544917276.
The previous prime is 4908695620391. The next prime is 4908695620421. The reversal of 4908695620397 is 7930265968094.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4908695620397 - 224 = 4908678843181 is a prime.
It is a super-3 number, since 3×49086956203973 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4908695620391) 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, 75302693 + ... + 75367850.
It is an arithmetic number, because the mean of its divisors is an integer number (1227211580880).
Almost surely, 24908695620397 is an apocalyptic number.
It is an amenable number.
4908695620397 is a deficient number, since it is larger than the sum of its proper divisors (150703123).
4908695620397 is a wasteful number, since it uses less digits than its factorization.
4908695620397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150703122.
The product of its (nonzero) digits is 176359680, while the sum is 68.
The spelling of 4908695620397 in words is "four trillion, nine hundred eight billion, six hundred ninety-five million, six hundred twenty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •