Base | Representation |
---|---|
bin | 1011110110101000111001… |
… | …1010111011110000010000 |
3 | 1201010222021111100010111121 |
4 | 2331222032122323300100 |
5 | 3202014214432414412 |
6 | 43415231420052024 |
7 | 2513424552550252 |
oct | 275521632736020 |
9 | 51128244303447 |
10 | 13033320201232 |
11 | 4175444526091 |
12 | 1565b40694014 |
13 | 737062b86716 |
14 | 330b5d3c7cd2 |
15 | 17905ea04107 |
hex | bda8e6bbc10 |
13033320201232 has 20 divisors (see below), whose sum is σ = 25350314932476. Its totient is φ = 6491303444480.
The previous prime is 13033320201217. The next prime is 13033320201233. The reversal of 13033320201232 is 23210202333031.
It can be written as a sum of positive squares in 2 ways, for example, as 9922978805776 + 3110341395456 = 3150076^2 + 1763616^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13033320201197 and 13033320201206.
It is not an unprimeable number, because it can be changed into a prime (13033320201233) 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 3 ways as a sum of consecutive naturals, for example, 1584786769 + ... + 1584794992.
Almost surely, 213033320201232 is an apocalyptic number.
It is an amenable number.
13033320201232 is a deficient number, since it is larger than the sum of its proper divisors (12316994731244).
13033320201232 is a wasteful number, since it uses less digits than its factorization.
13033320201232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3169582026 (or 3169582020 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13033320201232 its reverse (23210202333031), we get a palindrome (36243522534263).
The spelling of 13033320201232 in words is "thirteen trillion, thirty-three billion, three hundred twenty million, two hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •