Base | Representation |
---|---|
bin | 11000001010100011… |
… | …11010110001111111 |
3 | 1020111010220022222020 |
4 | 30011101322301333 |
5 | 203032203011213 |
6 | 5543202451223 |
7 | 636331542651 |
oct | 140521726177 |
9 | 36433808866 |
10 | 12973485183 |
11 | 555821548a |
12 | 2620963b13 |
13 | 12b9a4a169 |
14 | 8b10266d1 |
15 | 50de65923 |
hex | 30547ac7f |
12973485183 has 8 divisors (see below), whose sum is σ = 17363753088. Its totient is φ = 8616103704.
The previous prime is 12973485181. The next prime is 12973485191. The reversal of 12973485183 is 38158437921.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12973485183 - 21 = 12973485181 is a prime.
It is a super-2 number, since 2×129734851832 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12973485181) 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 7 ways as a sum of consecutive naturals, for example, 8220685 + ... + 8222262.
It is an arithmetic number, because the mean of its divisors is an integer number (2170469136).
Almost surely, 212973485183 is an apocalyptic number.
12973485183 is a deficient number, since it is larger than the sum of its proper divisors (4390267905).
12973485183 is a wasteful number, since it uses less digits than its factorization.
12973485183 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16443213.
The product of its digits is 1451520, while the sum is 51.
The spelling of 12973485183 in words is "twelve billion, nine hundred seventy-three million, four hundred eighty-five thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •