Base | Representation |
---|---|
bin | 1011011001100010110010… |
… | …1111010001110101101000 |
3 | 1122101012001201220010202202 |
4 | 2312120230233101311220 |
5 | 3120322014040123224 |
6 | 42353443331515332 |
7 | 2432340644036201 |
oct | 266305457216550 |
9 | 48335051803682 |
10 | 12533465161064 |
11 | 3aa245a378101 |
12 | 14a50a0158b48 |
13 | 6cbb92a916c3 |
14 | 3148a153a5a8 |
15 | 16b0569a6eae |
hex | b662cbd1d68 |
12533465161064 has 32 divisors (see below), whose sum is σ = 24010506259200. Its totient is φ = 6130777423680.
The previous prime is 12533465161001. The next prime is 12533465161069. The reversal of 12533465161064 is 46016156433521.
It is a super-2 number, since 2×125334651610642 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is not an unprimeable number, because it can be changed into a prime (12533465161069) 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, 6239324 + ... + 7999755.
It is an arithmetic number, because the mean of its divisors is an integer number (750328320600).
Almost surely, 212533465161064 is an apocalyptic number.
It is an amenable number.
12533465161064 is a deficient number, since it is larger than the sum of its proper divisors (11477041098136).
12533465161064 is a wasteful number, since it uses less digits than its factorization.
12533465161064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14241473 (or 14241469 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 12533465161064 in words is "twelve trillion, five hundred thirty-three billion, four hundred sixty-five million, one hundred sixty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •