Base | Representation |
---|---|
bin | 1100000111000011001101… |
… | …1000100000111110100010 |
3 | 1202010221000102002112101110 |
4 | 3001300303120200332202 |
5 | 3221124123213312041 |
6 | 44152540223044150 |
7 | 2542665400235523 |
oct | 301606330407642 |
9 | 52127012075343 |
10 | 13315260682146 |
11 | 4273a745883a5 |
12 | 15b0705a40656 |
13 | 757815345957 |
14 | 340667c4884a |
15 | 18156199e516 |
hex | c1c33620fa2 |
13315260682146 has 16 divisors (see below), whose sum is σ = 27548815204800. Its totient is φ = 4285371253968.
The previous prime is 13315260682111. The next prime is 13315260682147. The reversal of 13315260682146 is 64128606251331.
It is a super-2 number, since 2×133152606821462 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13315260682095 and 13315260682104.
It is not an unprimeable number, because it can be changed into a prime (13315260682147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38262243166 + ... + 38262243513.
It is an arithmetic number, because the mean of its divisors is an integer number (1721800950300).
Almost surely, 213315260682146 is an apocalyptic number.
13315260682146 is an abundant number, since it is smaller than the sum of its proper divisors (14233554522654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13315260682146 is a wasteful number, since it uses less digits than its factorization.
13315260682146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76524486713.
The product of its (nonzero) digits is 1244160, while the sum is 48.
The spelling of 13315260682146 in words is "thirteen trillion, three hundred fifteen billion, two hundred sixty million, six hundred eighty-two thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •