Base | Representation |
---|---|
bin | 1011110110100101000111… |
… | …0011000111011000001000 |
3 | 1201010212122121112120020011 |
4 | 2331221101303013120020 |
5 | 3202010124100130440 |
6 | 43414542444441304 |
7 | 2513360422566331 |
oct | 275512163073010 |
9 | 51125577476204 |
10 | 13032303130120 |
11 | 4174a7240254a |
12 | 15658b7b49234 |
13 | 736c302502b1 |
14 | 330aa42b5288 |
15 | 17900059e9ea |
hex | bda51cc7608 |
13032303130120 has 32 divisors (see below), whose sum is σ = 29331819970200. Its totient is φ = 5211296731648.
The previous prime is 13032303130081. The next prime is 13032303130201. The reversal of 13032303130120 is 2103130323031.
It can be written as a sum of positive squares in 4 ways, for example, as 8942743355364 + 4089559774756 = 2990442^2 + 2022266^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13032303130091 and 13032303130100.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50636299 + ... + 50893018.
Almost surely, 213032303130120 is an apocalyptic number.
13032303130120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13032303130120 is an abundant number, since it is smaller than the sum of its proper divisors (16299516840080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032303130120 is a wasteful number, since it uses less digits than its factorization.
13032303130120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101532537 (or 101532533 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13032303130120 its reverse (2103130323031), we get a palindrome (15135433453151).
The spelling of 13032303130120 in words is "thirteen trillion, thirty-two billion, three hundred three million, one hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •