Base | Representation |
---|---|
bin | 1100000010000110011000… |
… | …0001110011110010110000 |
3 | 1201211210111011011010220122 |
4 | 3000201212001303302300 |
5 | 3213230433010201000 |
6 | 44045513001425412 |
7 | 2533564651115630 |
oct | 300414601636260 |
9 | 51753434133818 |
10 | 13230211022000 |
11 | 42409a0235975 |
12 | 159812aa9b268 |
13 | 74c7accb576b |
14 | 33a4ba5a26c0 |
15 | 17e23501a085 |
hex | c0866073cb0 |
13230211022000 has 80 divisors (see below), whose sum is σ = 36560743182912. Its totient is φ = 4536072345600.
The previous prime is 13230211021991. The next prime is 13230211022023. The reversal of 13230211022000 is 22011203231.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 13230211022000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 472493537 + ... + 472521536.
Almost surely, 213230211022000 is an apocalyptic number.
13230211022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13230211022000 is an abundant number, since it is smaller than the sum of its proper divisors (23330532160912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13230211022000 is an equidigital number, since it uses as much as digits as its factorization.
13230211022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945015103 (or 945015087 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 13230211022000 its reverse (22011203231), we get a palindrome (13252222225231).
The spelling of 13230211022000 in words is "thirteen trillion, two hundred thirty billion, two hundred eleven million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •