Base | Representation |
---|---|
bin | 1100000111010100111100… |
… | …0100110000000001010110 |
3 | 1202011101022010000121221010 |
4 | 3001311033010300001112 |
5 | 3221213400134331410 |
6 | 44155044404433050 |
7 | 2543224342566150 |
oct | 301651704600126 |
9 | 52141263017833 |
10 | 13320020230230 |
11 | 4275a9719330a |
12 | 15b16139a8786 |
13 | 7580c3425aac |
14 | 340999dd7ad0 |
15 | 18173e75ac20 |
hex | c1d4f130056 |
13320020230230 has 32 divisors (see below), whose sum is σ = 36534912632064. Its totient is φ = 3044576052576.
The previous prime is 13320020230217. The next prime is 13320020230301. The reversal of 13320020230230 is 3203202002331.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13320020230197 and 13320020230206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31714333672 + ... + 31714334091.
It is an arithmetic number, because the mean of its divisors is an integer number (1141716019752).
Almost surely, 213320020230230 is an apocalyptic number.
13320020230230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13320020230230 is an abundant number, since it is smaller than the sum of its proper divisors (23214892401834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320020230230 is a wasteful number, since it uses less digits than its factorization.
13320020230230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63428667780.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 13320020230230 its reverse (3203202002331), we get a palindrome (16523222232561).
The spelling of 13320020230230 in words is "thirteen trillion, three hundred twenty billion, twenty million, two hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •