Base | Representation |
---|---|
bin | 1011111101101111110011… |
… | …0000000111110000001011 |
3 | 1201120122110120002120020012 |
4 | 2333123330300013300023 |
5 | 3211014310131132301 |
6 | 43551304332022135 |
7 | 2525306553546530 |
oct | 277337460076013 |
9 | 51518416076205 |
10 | 13155430333451 |
11 | 421220650982a |
12 | 158573b00194b |
13 | 745723298723 |
14 | 336a24a96d87 |
15 | 17c309d73ebb |
hex | bf6fcc07c0b |
13155430333451 has 8 divisors (see below), whose sum is σ = 15035629059840. Its totient is φ = 11275444491048.
The previous prime is 13155430333421. The next prime is 13155430333453. The reversal of 13155430333451 is 15433303455131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13155430333451 - 214 = 13155430317067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13155430333399 and 13155430333408.
It is not an unprimeable number, because it can be changed into a prime (13155430333453) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53088551 + ... + 53335776.
It is an arithmetic number, because the mean of its divisors is an integer number (1879453632480).
Almost surely, 213155430333451 is an apocalyptic number.
13155430333451 is a deficient number, since it is larger than the sum of its proper divisors (1880198726389).
13155430333451 is a wasteful number, since it uses less digits than its factorization.
13155430333451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106441993.
The product of its (nonzero) digits is 486000, while the sum is 41.
Adding to 13155430333451 its reverse (15433303455131), we get a palindrome (28588733788582).
The spelling of 13155430333451 in words is "thirteen trillion, one hundred fifty-five billion, four hundred thirty million, three hundred thirty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •