Base | Representation |
---|---|
bin | 1001100110001011001101… |
… | …0001011011001111001011 |
3 | 1101100201010111202002020002 |
4 | 2121202303101123033023 |
5 | 2340333331011244101 |
6 | 34235133515553215 |
7 | 2136213462550250 |
oct | 231426321331713 |
9 | 41321114662202 |
10 | 10551447368651 |
11 | 33a8930a67002 |
12 | 1224b3645b80b |
13 | 5b6cc6b6b267 |
14 | 28699ada5427 |
15 | 13470251ad6b |
hex | 998b345b3cb |
10551447368651 has 8 divisors (see below), whose sum is σ = 12059035718400. Its totient is φ = 9043918700328.
The previous prime is 10551447368641. The next prime is 10551447368711. The reversal of 10551447368651 is 15686374415501.
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 10551447368651 - 234 = 10534267499467 is a prime.
It is a super-2 number, since 2×105514473686512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10551447368641) 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, 14540861 + ... + 15249246.
It is an arithmetic number, because the mean of its divisors is an integer number (1507379464800).
Almost surely, 210551447368651 is an apocalyptic number.
10551447368651 is a deficient number, since it is larger than the sum of its proper divisors (1507588349749).
10551447368651 is an equidigital number, since it uses as much as digits as its factorization.
10551447368651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29840713.
The product of its (nonzero) digits is 12096000, while the sum is 56.
The spelling of 10551447368651 in words is "ten trillion, five hundred fifty-one billion, four hundred forty-seven million, three hundred sixty-eight thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •