Base | Representation |
---|---|
bin | 1100010001000001110111… |
… | …0110110110010010111011 |
3 | 1202202022112012002011011010 |
4 | 3010100131312312102323 |
5 | 3231431224221230000 |
6 | 44403411552405003 |
7 | 2561244645310266 |
oct | 304203566662273 |
9 | 52668465064133 |
10 | 13486698226875 |
11 | 432a749608165 |
12 | 161998bb46763 |
13 | 76aa37065603 |
14 | 348a8c7a7cdd |
15 | 185c47608d50 |
hex | c441ddb64bb |
13486698226875 has 30 divisors (see below), whose sum is σ = 22470902425092. Its totient is φ = 7192820910000.
The previous prime is 13486698226861. The next prime is 13486698226997. The reversal of 13486698226875 is 57862289668431.
It is not a de Polignac number, because 13486698226875 - 220 = 13486697178299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (75).
It is a junction number, because it is equal to n+sod(n) for n = 13486698226797 and 13486698226806.
It is an unprimeable number.
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 29 ways as a sum of consecutive naturals, for example, 158978220 + ... + 159063030.
Almost surely, 213486698226875 is an apocalyptic number.
13486698226875 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13486698226875 is a deficient number, since it is larger than the sum of its proper divisors (8984204198217).
13486698226875 is an frugal number, since it uses more digits than its factorization.
13486698226875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169645 (or 84819 counting only the distinct ones).
The product of its digits is 1672151040, while the sum is 75.
13486698226875 divided by its sum of digits (75) gives a square (179822643025 = 4240552).
The spelling of 13486698226875 in words is "thirteen trillion, four hundred eighty-six billion, six hundred ninety-eight million, two hundred twenty-six thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •