Base | Representation |
---|---|
bin | 11001110011010110110110… |
… | …11011011011110111101011 |
3 | 21102220022101001102102122210 |
4 | 30321223123123123313223 |
5 | 24414112412020220012 |
6 | 320402030542020203 |
7 | 14644226015032614 |
oct | 1471533333336753 |
9 | 242808331372583 |
10 | 56740199382507 |
11 | 17096424379203 |
12 | 6444769b77663 |
13 | 25877686a1474 |
14 | 100235156ac0b |
15 | 685e21e1d23c |
hex | 339adb6dbdeb |
56740199382507 has 8 divisors (see below), whose sum is σ = 75654103051584. Its totient is φ = 37826547650888.
The previous prime is 56740199382479. The next prime is 56740199382523. The reversal of 56740199382507 is 70528399104765.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56740199382507 - 27 = 56740199382379 is a prime.
It is not an unprimeable number, because it can be changed into a prime (56740199382527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62458233 + ... + 63360170.
It is an arithmetic number, because the mean of its divisors is an integer number (9456762881448).
It is a 1-persistent number, because it is pandigital, but 2⋅56740199382507 = 113480398765014 is not.
Almost surely, 256740199382507 is an apocalyptic number.
56740199382507 is a deficient number, since it is larger than the sum of its proper divisors (18913903669077).
56740199382507 is a wasteful number, since it uses less digits than its factorization.
56740199382507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125968729.
The product of its (nonzero) digits is 114307200, while the sum is 66.
The spelling of 56740199382507 in words is "fifty-six trillion, seven hundred forty billion, one hundred ninety-nine million, three hundred eighty-two thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •