Base | Representation |
---|---|
bin | 101101011001111000001… |
… | …1011100001100101111001 |
3 | 211002120101001210120000001 |
4 | 1122303300123201211321 |
5 | 1304220142010323423 |
6 | 21134433304513001 |
7 | 1212564050012440 |
oct | 132636033414571 |
9 | 24076331716001 |
10 | 6240326261113 |
11 | 1a9656454247a |
12 | 84950077b761 |
13 | 3635ca1c5529 |
14 | 178067929d57 |
15 | ac4d288dcad |
hex | 5acf06e1979 |
6240326261113 has 8 divisors (see below), whose sum is σ = 7148348547840. Its totient is φ = 5336440751040.
The previous prime is 6240326261107. The next prime is 6240326261119. The reversal of 6240326261113 is 3111626230426.
It is an interprime number because it is at equal distance from previous prime (6240326261107) and next prime (6240326261119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6240326261113 - 229 = 6239789390201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6240326261119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1034190928 + ... + 1034196961.
It is an arithmetic number, because the mean of its divisors is an integer number (893543568480).
Almost surely, 26240326261113 is an apocalyptic number.
It is an amenable number.
6240326261113 is a deficient number, since it is larger than the sum of its proper divisors (908022286727).
6240326261113 is a wasteful number, since it uses less digits than its factorization.
6240326261113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2068388327.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 6240326261113 in words is "six trillion, two hundred forty billion, three hundred twenty-six million, two hundred sixty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •