Base | Representation |
---|---|
bin | 111010111101000111010… |
… | …010010001010100011001 |
3 | 112100022020120000200110122 |
4 | 322331013102101110121 |
5 | 1012334131113210433 |
6 | 12341055313323025 |
7 | 565462142633543 |
oct | 72750722212431 |
9 | 15308216020418 |
10 | 4051350131993 |
11 | 132219359288a |
12 | 555218b66475 |
13 | 23506b4a6918 |
14 | 10012d0c0693 |
15 | 705b9144198 |
hex | 3af47491519 |
4051350131993 has 4 divisors (see below), whose sum is σ = 4051640211840. Its totient is φ = 4051060052148.
The previous prime is 4051350131957. The next prime is 4051350132001. The reversal of 4051350131993 is 3991310531504.
4051350131993 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4051350131993 - 222 = 4051345937689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4051350131293) 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, 145018973 + ... + 145046906.
It is an arithmetic number, because the mean of its divisors is an integer number (1012910052960).
Almost surely, 24051350131993 is an apocalyptic number.
It is an amenable number.
4051350131993 is a deficient number, since it is larger than the sum of its proper divisors (290079847).
4051350131993 is a wasteful number, since it uses less digits than its factorization.
4051350131993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290079846.
The product of its (nonzero) digits is 218700, while the sum is 44.
The spelling of 4051350131993 in words is "four trillion, fifty-one billion, three hundred fifty million, one hundred thirty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •