Base | Representation |
---|---|
bin | 1100001000001101111100… |
… | …0001010100000001110011 |
3 | 1202012211210101112002101011 |
4 | 3002003133001110001303 |
5 | 3221441213424301011 |
6 | 44210054515051351 |
7 | 2544305444012500 |
oct | 302033701240163 |
9 | 52184711462334 |
10 | 13335320150131 |
11 | 4281528634611 |
12 | 15b45838a0b57 |
13 | 759691142335 |
14 | 34160bdb04a7 |
15 | 181d37a65621 |
hex | c20df054073 |
13335320150131 has 6 divisors (see below), whose sum is σ = 15512515276740. Its totient is φ = 11430274414356.
The previous prime is 13335320150123. The next prime is 13335320150239. The reversal of 13335320150131 is 13105102353331.
It is a happy number.
It is not a de Polignac number, because 13335320150131 - 23 = 13335320150123 is a prime.
It is a super-2 number, since 2×133353201501312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13335320150093 and 13335320150102.
It is not an unprimeable number, because it can be changed into a prime (13335320150431) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 136074695361 + ... + 136074695458.
It is an arithmetic number, because the mean of its divisors is an integer number (2585419212790).
Almost surely, 213335320150131 is an apocalyptic number.
13335320150131 is a deficient number, since it is larger than the sum of its proper divisors (2177195126609).
13335320150131 is an equidigital number, since it uses as much as digits as its factorization.
13335320150131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272149390833 (or 272149390826 counting only the distinct ones).
The product of its (nonzero) digits is 12150, while the sum is 31.
The spelling of 13335320150131 in words is "thirteen trillion, three hundred thirty-five billion, three hundred twenty million, one hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •