Base | Representation |
---|---|
bin | 1101001100110010010101… |
… | …1000011100111101001000 |
3 | 1220101110102100012010100110 |
4 | 3103030211120130331020 |
5 | 3400241240321111412 |
6 | 50511154455434320 |
7 | 3025360432436463 |
oct | 323144530347510 |
9 | 56343370163313 |
10 | 14513321660232 |
11 | 469607979663a |
12 | 17649420859a0 |
13 | 8137a5cb64c5 |
14 | 38263ca2c2da |
15 | 1a27d131ed3c |
hex | d332561cf48 |
14513321660232 has 32 divisors (see below), whose sum is σ = 36742586486400. Its totient is φ = 4776536241984.
The previous prime is 14513321660137. The next prime is 14513321660287. The reversal of 14513321660232 is 23206612331541.
It is a super-2 number, since 2×145133216602322 (a number of 27 digits) contains 22 as substring.
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, 3827350863 + ... + 3827354654.
It is an arithmetic number, because the mean of its divisors is an integer number (1148205827700).
Almost surely, 214513321660232 is an apocalyptic number.
14513321660232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14513321660232 is an abundant number, since it is smaller than the sum of its proper divisors (22229264826168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14513321660232 is a wasteful number, since it uses less digits than its factorization.
14513321660232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7654705605 (or 7654705601 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 39.
Adding to 14513321660232 its reverse (23206612331541), we get a palindrome (37719933991773).
The spelling of 14513321660232 in words is "fourteen trillion, five hundred thirteen billion, three hundred twenty-one million, six hundred sixty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •