Base | Representation |
---|---|
bin | 1100000111011010001101… |
… | …0010111001000010100010 |
3 | 1202011111221120211010001220 |
4 | 3001312203102321002202 |
5 | 3221224243401121310 |
6 | 44155440522035510 |
7 | 2543304351045441 |
oct | 301664322710242 |
9 | 52144846733056 |
10 | 13321433223330 |
11 | 4276651846a01 |
12 | 15b1949048b96 |
13 | 75828a0a359b |
14 | 340a9192cd58 |
15 | 1817c381a670 |
hex | c1da34b90a2 |
13321433223330 has 32 divisors (see below), whose sum is σ = 31991409520128. Its totient is φ = 3550163328000.
The previous prime is 13321433223299. The next prime is 13321433223359. The reversal of 13321433223330 is 3332233412331.
It is a junction number, because it is equal to n+sod(n) for n = 13321433223291 and 13321433223300.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138630226 + ... + 138726285.
It is an arithmetic number, because the mean of its divisors is an integer number (999731547504).
Almost surely, 213321433223330 is an apocalyptic number.
13321433223330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13321433223330 is an abundant number, since it is smaller than the sum of its proper divisors (18669976296798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13321433223330 is a wasteful number, since it uses less digits than its factorization.
13321433223330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277358122.
The product of its (nonzero) digits is 69984, while the sum is 33.
Adding to 13321433223330 its reverse (3332233412331), we get a palindrome (16653666635661).
The spelling of 13321433223330 in words is "thirteen trillion, three hundred twenty-one billion, four hundred thirty-three million, two hundred twenty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •