Base | Representation |
---|---|
bin | 1011111101011100001010… |
… | …1101110001110000100100 |
3 | 1201120010212101011220011021 |
4 | 2333113002231301300210 |
5 | 3210423012342021002 |
6 | 43545033442220524 |
7 | 2525032156641262 |
oct | 277270255616044 |
9 | 51503771156137 |
10 | 13150161673252 |
11 | 420aa524933aa |
12 | 158470a654744 |
13 | 745093892b06 |
14 | 33668505d432 |
15 | 17c0ec54e737 |
hex | bf5c2b71c24 |
13150161673252 has 24 divisors (see below), whose sum is σ = 24367877241624. Its totient is φ = 6187955515392.
The previous prime is 13150161673211. The next prime is 13150161673277. The reversal of 13150161673252 is 25237616105131.
It can be written as a sum of positive squares in 4 ways, for example, as 4470915718116 + 8679245955136 = 2114454^2 + 2946056^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13150161673199 and 13150161673208.
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 7 ways as a sum of consecutive naturals, for example, 4367253 + ... + 6735964.
It is an arithmetic number, because the mean of its divisors is an integer number (1015328218401).
Almost surely, 213150161673252 is an apocalyptic number.
It is an amenable number.
13150161673252 is a deficient number, since it is larger than the sum of its proper divisors (11217715568372).
13150161673252 is a wasteful number, since it uses less digits than its factorization.
13150161673252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11120655 (or 11120653 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 43.
Adding to 13150161673252 its reverse (25237616105131), we get a palindrome (38387777778383).
The spelling of 13150161673252 in words is "thirteen trillion, one hundred fifty billion, one hundred sixty-one million, six hundred seventy-three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •