Base | Representation |
---|---|
bin | 1101110101100010011100… |
… | …0110110010111011100011 |
3 | 1222212101112010000201120002 |
4 | 3131120213012302323203 |
5 | 3443224101121132311 |
6 | 52204541532410215 |
7 | 3130063661344010 |
oct | 335304706627343 |
9 | 58771463021502 |
10 | 15213430255331 |
11 | 4935a85847350 |
12 | 185856b01696b |
13 | 86480aab61a9 |
14 | 3a8496520707 |
15 | 1b5b09bc893b |
hex | dd6271b2ee3 |
15213430255331 has 32 divisors (see below), whose sum is σ = 19013010272256. Its totient is φ = 11826137700000.
The previous prime is 15213430255277. The next prime is 15213430255379. The reversal of 15213430255331 is 13355203431251.
It is a cyclic number.
It is not a de Polignac number, because 15213430255331 - 218 = 15213429993187 is a prime.
It is a super-2 number, since 2×152134302553312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (15213430255031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67728956 + ... + 67953206.
It is an arithmetic number, because the mean of its divisors is an integer number (594156571008).
Almost surely, 215213430255331 is an apocalyptic number.
15213430255331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
15213430255331 is a deficient number, since it is larger than the sum of its proper divisors (3799580016925).
15213430255331 is a wasteful number, since it uses less digits than its factorization.
15213430255331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226383.
The product of its (nonzero) digits is 162000, while the sum is 38.
Adding to 15213430255331 its reverse (13355203431251), we get a palindrome (28568633686582).
The spelling of 15213430255331 in words is "fifteen trillion, two hundred thirteen billion, four hundred thirty million, two hundred fifty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •