Base | Representation |
---|---|
bin | 100011000000100101000… |
… | …0101110001001000110101 |
3 | 122000222121010022112010121 |
4 | 1012001022011301020311 |
5 | 1112313132214204433 |
6 | 14122231011451541 |
7 | 1004425043363530 |
oct | 106011205611065 |
9 | 18028533275117 |
10 | 4811606397493 |
11 | 1595655411605 |
12 | 6586312b6bb1 |
13 | 28b96a4c821c |
14 | 128c50d05a17 |
15 | 852631bec2d |
hex | 4604a171235 |
4811606397493 has 4 divisors (see below), whose sum is σ = 5498978740000. Its totient is φ = 4124234054988.
The previous prime is 4811606397431. The next prime is 4811606397503. The reversal of 4811606397493 is 3947936061184.
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 4811606397493 - 221 = 4811604300341 is a prime.
It is a super-2 number, since 2×48116063974932 (a number of 26 digits) contains 22 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 (4811606397413) 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, 343686171243 + ... + 343686171256.
It is an arithmetic number, because the mean of its divisors is an integer number (1374744685000).
Almost surely, 24811606397493 is an apocalyptic number.
It is an amenable number.
4811606397493 is a deficient number, since it is larger than the sum of its proper divisors (687372342507).
4811606397493 is an equidigital number, since it uses as much as digits as its factorization.
4811606397493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 687372342506.
The product of its (nonzero) digits is 23514624, while the sum is 61.
The spelling of 4811606397493 in words is "four trillion, eight hundred eleven billion, six hundred six million, three hundred ninety-seven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •