Base | Representation |
---|---|
bin | 10001000000110111… |
… | …111010110001001101 |
3 | 1202011010222020210110 |
4 | 101000313322301031 |
5 | 244403134112040 |
6 | 12220424230233 |
7 | 1214463505233 |
oct | 210067726115 |
9 | 52133866713 |
10 | 18268269645 |
11 | 7824a6440a |
12 | 365a00b379 |
13 | 195199b912 |
14 | c54300953 |
15 | 71dbea980 |
hex | 440dfac4d |
18268269645 has 8 divisors (see below), whose sum is σ = 29229231456. Its totient is φ = 9743077136.
The previous prime is 18268269641. The next prime is 18268269659. The reversal of 18268269645 is 54696286281.
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 18268269645 - 22 = 18268269641 is a prime.
It is a super-3 number, since 3×182682696453 (a number of 32 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18268269641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 608942307 + ... + 608942336.
It is an arithmetic number, because the mean of its divisors is an integer number (3653653932).
Almost surely, 218268269645 is an apocalyptic number.
18268269645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
18268269645 is a deficient number, since it is larger than the sum of its proper divisors (10960961811).
18268269645 is a wasteful number, since it uses less digits than its factorization.
18268269645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1217884651.
The product of its digits is 9953280, while the sum is 57.
The spelling of 18268269645 in words is "eighteen billion, two hundred sixty-eight million, two hundred sixty-nine thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •